ECE 673 / SYST 620� Discrete Event Systems� (3.0:3)
Prerequisites: ECE 521 or SYST 611 or equivalent
Introduction to modeling and analysis of discrete event dynamical systems. Course covers elements of discrete mathematics and then focuses on Petri Net models and their basic properties: locality and concurrency. Condition/event systems; Place/transition nets; Colored Petri nets; Reachability graphs (Occurrence nets); and Invariant Analysis. Temporal issues in Petri nets and Temporal Logic. Stochastic Petri nets. Relation to other discrete event models of dynamical systems. Applications of the theory to modeling and simulation and to systems engineering problems
�Instructor: Prof. Alexander H. Levis���� S&T II, Room 261������� 703 993 1619�� [email protected]
Course Call
numbers: ECE 673 001 72831; SYST 620 001 72820; SYST 620 622� 76879
Fall 2006: T 4:30 �
7:10 pm����� in Room� IN 131 (Innovation Hall)
COURSE OUTLINE (subject to change)
|
Introduction:�
Systems and Models; Petri Net basics |
|
Essential Features of Petri Nets; CPN Tools I |
|
Petri Net models and Definitions |
|
Colored Petri Nets; CPN Tools II |
|
Petri Net properties: State Space methods |
|
Petri net properties: Structural Methods and Invariants |
|
Hierarchical Petri Nets, Petri Nets and Time, Petri Net
models |
|
Mid Term |
|
Petri net deconstruction; The Lattice algorithm |
|
Time in CPN |
|
State Space analysis in CPN |
|
Petri Net applications: V&V of rule bases, Adaptive
architectures |
|
PN models and other DEDS models (Languages and Automata) |
|
Verification Algorithms |
|
Final Exam |
Kurt Jensen and Lars Kristensen, Coloured
Petri Nets, Springer,
Detailed class notes by A. H. Levis
Student Evaluation Criteria: Homework 40%;� Midterm 25%; Final 35%