Free choice Petri nets
Author(s)
Bibliographic Information
Free choice Petri nets
（Cambridge tracts in theoretical computer science, 40）
Cambridge University Press, 2005
Available at / 3 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
The digitally printed first paperback version 2005
Description and Table of Contents
Description
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.
Table of Contents
- 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.
by "Nielsen BookData"
