Faculty of Information Technology, BUT

Course details

Theoretical Computer Science 2

TI2 Acad. year 2004/2005 Summer semester 6 credits

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

Language of instruction

Czech

Completion

Examination (written)

Time span

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

Assessment points

50 exam, 30 half-term test, 20 projects

Department

Lecturer

Instructor

Marek Vladimír, Ing. (DITS FIT BUT)
Novosad Petr, Ing. (DITS FIT BUT)
Vojnar Tomáš, prof. Ing., Ph.D. (DITS FIT BUT)

Subject specific learning outcomes and competences

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

Generic learning outcomes and competences

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.

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 - others, projects and individual work of students

Five homework assignments covering design and analysis of low and high level Petri nets.

Progress assessment

Mid-term exam evaluation and evaluation of projects documentation.

Controlled instruction

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