Course detail

Theory and Applications of Petri Nets

FIT-TADAcad. year: 2010/2011

Not applicable.

Language of instruction

Czech

Number of ECTS credits

0

Mode of study

Not applicable.

Guarantor

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

Department

Department of Intelligent Systems (UITS)

Learning outcomes of the course unit

Not applicable.

Prerequisites

Not applicable.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Not applicable.

Assesment methods and criteria linked to learning outcomes

Not applicable.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

Not applicable.

Specification of controlled education, way of implementation and compensation for absences

Not applicable.

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic 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

Recommended reading

  • Reisich W.: Petri nets, Springer Verlag 1985
  • Jensen K.: Coloured Petri nets, Springer Verlag 1993
  • Češka M.: Petriho sítě, Akad.nakl. CERM, 1994
  • Wil van der Aalst and Kees van Hee: Workflow Management: Models, Methods, and Systems MIT Press, 368 pp., ISBN 0-262-01189-1
  • Unifying Petri Nets, Advances in Petri Nets, Ed.: Hartmut Ehrig, Gabriel Juhas, Julia Padberg, Grzegorz Rozenberg, Springer-Verlag Vol.: LNCS 2128, 485 pp., ISBN: 3-540-43067-9
  • http://www.fit.vutbr.cz/study/courses/TI1/public/ti.pdf

Classification of course in study plans

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, summer semester, elective

  • Programme VTI-DR-4 Doctoral

    branch DVI4 , any year of study, summer semester, elective

Type of course unit

 

Lecture

39 hours, optionally

Teacher / Lecturer

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

Syllabus

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

Exercise in computer lab

8 hours, optionally

Teacher / Lecturer

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