(to be offered next time in Fall 2010 semester)
Prerequisite: Graduate standing (Beside interest in concurrent systems modeling and analysis, working knowledge in linear algebra, matrix theory and linear equations is desirable) or consent of Instructor. CS 503 is recommended but is not required.
Text: T. Murata, "Petri Net Modeling and Analysis of Concurrent Systems" (Lecture Notes for CS 554) yearly expanded, updated and reprinted at UIC DocuTech Center. It will be made available at the UIC Book Store during the first week of Semester.
Major Topics (subject to change)
Part One: Modeling
Ch. 1: Introduction: historical notes, application areas, transition enabling and firing rules, incidence matrix and S- and T-invariants - an introduction
Ch. 2: Introductory Modeling Examples: FSMs, parallel activities, datafow computation, communication protocols, synchronization control, producers-consumers systems, formal languages, multiprocessor systems, Turing machine equivalent PNs
Ch. 3: High-level Petri Nets: their applications to rule-based systems, logic programs and inferences, non-monotonic reasoning, robot planning, concurrency control in distributed database
Part Two: Petri Nets with Timing
Ch. 4: Deterministic-, Stochastic-, and Fuzzy-timing Petri nets: their applications to performance modeling, a real-time network protocol, etc.
Part Three: Analysis
Ch. 5: Behavioral Properties: reachability, boundedness, liveness, reversibility, coverability, persistence, synchronic distance, fairness
Ch. 6: Analysis Methods: coverability and reachability graphs, incidence matrix and state equation, simple reduction techniques, hierarchical reachability graphs
Ch. 7: Liveness and Safeness: subclasses of PNs, siphons and traps, well-formed nets, LBFC nets and their analysis and synthesis
Ch. 8: Reachability Criteria: necessary and sufficient conditions for reachability, NP-complete reachability problems
Ch. 9: Structural Properties: structural liveness and boundedness, conservativeness, repetitiveness, consistency, S- and T-invariants-revisited, structural B-fairness
Ch. 10: Advanced Topics for Marked Graphs: equivalence class, weighted sum of tokens, token distance matrix, maximum concurrency, marked graph synthesis of synchronic distance matrix
For further information or question, contact Professor Murata at (312)996-2307 or e-mail to murat@uic.edu.