Design and Analysis with Petri Nets

Dr. rer. nat. W. Nauber

Lectures:      Monday, r. INF/E05 16.40 - 18.10 h

                        lecture 1: October 15th

                        lecture 2: October 22d

 


Practicals:    Friday, r. E40 (INF), 09.20 - 10.50 h, fortnight

                        practical 1: October 24th

Table of contents:

1       Introduction

1.1    Historical Remarks

1.2    Modelling of systems

1.3    An informal introduction

1.4    First definitions

2       Condition/Event Nets - Elementary Net Systems

2.1    Basic Definitions

2.2    Dynamic Behavior of EN-systems

3       Place-Transitions-Nets

4       Application of Petri Nets for the Modelling

4.1    Methodology for the Modelling with Petri Nets

4.2    Examples for the Modelling with Petri Nets

4.3    System Design with Petri Nets
5       Methods of Petri Net Analysis

5.1    Safety / Boundedness / Freeness of Contacts

5.2    Reachability / Coverability

5.3    Markable Places and Place Sets

5.4    Liveness of Transitions, Markings, Places and Nets

5.5    Deadlocks / Livelocks

5.6    Reversibility / Reproducibility

5.7    Conflicts

5.8    Structural Properties of Nets

5.9    Place and Transition Invariants

6       Algorithms for Petri Net Theory

7       High-Level Petri Nets

         (Inhibitor Nets, Selfmodifying Nets, Priority Nets, Timed Petri Nets,

          Time Petri Nets, Coloured Petri Nets, Predicate/Transitions Nets)

8       Net Transformations and Net Reductions

 

Downloads  NetEdit - graphical Petri Net Editor with simulation and analysis

 

Last modified: 13.08.08,  wn1@inf.tu-dresden.de