ECE 673 / SYST 620� Discrete Event Systems� (3.0:3)
Fall 2004: M
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
Course Call
numbers: ECE 673 001 (74307); SYST 620 001 (74308)
COURSE OUTLINE (subject to change as this is a new course)
|
Introduction:�
Systems and Models; Petri Net basics |
|
Essential Features of Petri Nets |
|
Petri Net models and Definitions |
|
Colored Petri nets |
|
Introduction to Net Analysis: Reachability graphs (state
space methods) |
|
Invariant Analysis � the Farkas
algorithm |
|
Deconstruction using invariants (structural methods) |
|
Mid Term |
|
Design: The Lattice algorithm |
|
Temporal issues in Petri nets |
|
Modeling and simulation using Colored Petri nets |
|
Stochastic Petri nets |
|
Architecture related issues |
|
Relation of Petri net models to other discrete event
models |
|
Final Exam |
Claude Girault and Rudiger Valk: Petri Nets for Systems Engineering, Springer, Berlin 2003
Detailed class notes by A. H. Levis
Student Evaluation Criteria:
�� Homework 40%�
�� Midterm 25%
�� Final� 35%