Title:

Theoretical Computer Science 2

Code:TI2
Ac.Year:ukončen 2005/2006
Sem:Summer
Language of Instruction:Czech
Public info:http://www.fit.vutbr.cz/study/courses/TI2/public/
Credits:6
Completion:examination (written)
Type of
instruction:
Hour/semLecturesSeminar
Exercises
Laboratory
Exercises
Computer
Exercises
Other
Hours:39001214
 ExamsTestsExercisesLaboratoriesOther
Points:60200020
Guarantor:Češka Milan, prof. RNDr., CSc. (DITS)
Lecturer:Češka Milan, prof. RNDr., CSc. (DITS)
Instructor:Marek Vladimír, Ing. (DITS)
Novosad Petr, Ing. (DITS)
Faculty:Faculty of Information Technology BUT
Department:Department of Intelligent Systems FIT BUT
Prerequisites: 
Modelling and Simulation (MSI), DITS
Theoretical Computer Science 1 (TI1), DITS
 
Learning objectives:
  To understand the basic concepts and methods of system modelling using Petri nets, to adopt the Petri nets theory and applications in problems of system modelling, design, and verification. To gaine practical experiences with representative Perti nets tools.
Description:
  Basic concepts of Petri nets, typical analysis problems, analysis methods, Petri net languages, restrictions and extensions of basic class of Petri nets, Coloured Petri nets, Hierarchical and Object oriented Petri nets, Petri nets tools, applications.
Knowledge and skills required for the course:
  Basic knowledge of discrete mathematics concepts including graph theory and formal languages concepts,  basic concepts of algorithmic complexity, and principles of computer modelling.
Subject specific learning outcomes and competencies:
  Theoretical and practical background for application of Petri nets and supporting tools in system modelling, design, and verification.
Generic learning outcomes and competencies:
  To understand the advantages of formal models and apply and transfer Petri nets appproaches to others formal models.
Syllabus of lectures:
 
  • Introduction to Petri nets, basic notions.
  • Condition/Event Petri nets.
  • Complementation, case graphs, and applications in C/E systems analysis.
  • Processes of C/E Petri nets, occurrences nets.
  • Properties of C/E Petri nets, synchronic distances, facts.
  • Place/Transition Petri nets, analysis problems.
  • Analysis of P/T Petri nets by reachability tree.
  • Invariants of P/T Petri nets.
  • Petri nets languages.
  • Marked graphs and Free choices Petri nets, Petri nets with inhibitors.
  • Coloured Petri nets, CPN Design, applications.
  • Analysis of Coloured Petri nets.
  • Hierarchical Coloured Petri nets and Object oriented Petri nets.
Syllabus of computer exercises:
 
  • Petri net tools for analysis and verification of low level Petri nets (INA, LOLA, PEP, Pesim) - 2 exercises.
  • Computerized tools for formal analysis and verification of models described in non Petri net formalism (Spin, Uppaal).
  • Petri net tools for analysis and verification of high level Petri nets (Design/CPN, PROD, Renew) - 2 exercises.
  • Petri net tools for analysis and verification of object oriented Petri nets (PNtalk).
Syllabus - others, projects and individual work of students:
 Seven homework assignments covering design and analysis of low and high level Petri nets.
Fundamental literature:
 
  • Reisich W.: Petri nets, Springer Verlag 1985
  • Jensen K.: Coloured Petri nets, Springer Verlag 1993
  • Češka M.: Petriho sítě, Akad.nakl. CERM, Brno 1994
Study literature:
 
  • Reisich W.: Petri nets, Springer Verlag 1985
  • Jensen K.: Coloured Petri nets, Springer Verlag 1993
  • Češka M.: Petriho sítě, Akad.nakl. CERM, Brno 1994
Controlled instruction:
  Written mid-term exam, check points for projects elaboration.
Progress assessment:
  Mid-term exam evaluation and evaluation of projects documentation.
 

Your IPv4 address: 34.229.97.16
Switch to https

DNSSEC [dnssec]