Free Choice Petri Nets
Seiten
2005
Cambridge University Press (Verlag)
978-0-521-01945-3 (ISBN)
Cambridge University Press (Verlag)
978-0-521-01945-3 (ISBN)
Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques.
Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike.
Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike.
1. Introduction; 2. Analysis techniques for petri nets; 3. S-systems and T-systems; 4. Liveness in free choice; 5. The coverability theorems; 6. The rank theorem; 7. Reduction and synthesis; 8. Home markings; 9. Reachability and shortest sequences; 10. Generalizations; Index; List of symbols; List of main results.
| Erscheint lt. Verlag | 8.9.2005 |
|---|---|
| Reihe/Serie | Cambridge Tracts in Theoretical Computer Science |
| Zusatzinfo | Worked examples or Exercises; 64 Line drawings, unspecified |
| Verlagsort | Cambridge |
| Sprache | englisch |
| Maße | 170 x 245 mm |
| Gewicht | 414 g |
| Themenwelt | Mathematik / Informatik ► Informatik ► Theorie / Studium |
| Mathematik / Informatik ► Mathematik ► Logik / Mengenlehre | |
| ISBN-10 | 0-521-01945-1 / 0521019451 |
| ISBN-13 | 978-0-521-01945-3 / 9780521019453 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
Mehr entdecken
aus dem Bereich
aus dem Bereich
Grundlagen – Anwendungen – Perspektiven
Buch | Softcover (2022)
Springer Vieweg (Verlag)
CHF 48,95
Eine Einführung in die Systemtheorie
Buch | Softcover (2022)
UTB (Verlag)
CHF 34,95
was jeder über Informatik wissen sollte
Buch | Softcover (2024)
Springer Vieweg (Verlag)
CHF 53,15
