Course details

Theoretical Computer Science 2

TI2 Acad. year 2004/2005 Summer semester 6 credits

Current academic year

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.

Guarantor

Češka Milan, prof. RNDr., CSc.

Language of instruction

Czech

Completion

Examination

Time span

  • 39 hrs lectures
  • 12 hrs pc labs
  • 14 hrs projects

Department

Department of Intelligent Systems (UITS)

Subject specific learning outcomes and competences

Theoretical and practical background for application of Petri nets and supporting tools in system modelling, design, and verification.

Základní znalosti z binárních relací, teorie grafů a formálních jazyků včetně konečných a zásobníkových automatů, Turingových strojů, pojmů algoritmické složitosti a a principů počítačového modelování.

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.

Prerequisite knowledge and skills

There are no prerequisites

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

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

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).

Progress assessment

Study evaluation is based on marks obtained for specified items. Minimimum number of marks to pass is 50.

Controlled instruction

Written mid-term exam, check points for projects elaboration.

Back to top