Petri nets in modeling and analysis of concurrent systems

The subject matter of the book includes a comprehensive introduction to Petri's network theory. Nine classes of the network are discussed, including the networks most commonly found in literature (generalized networks, colored networks), as well as those newly proposed (RTCP-networks). For each of the discussed classes, examples of their application to the modeling of various systems and methods for the analysis of their most important properties are presented.
Reading this book, you can not only learn the basic features of individual network classes and the differences between them, but also choose the class that will be the most suitable for your application.
The book is intended mainly for students of computer science, electronics, automation and telecommunications. We also recommend it to anyone who wants to use Petri's networks in scientific research or in engineering practice, lecturers of subjects that at least partly relate to the Petri network, and lecturers on Petri network theory.

Table of Contents

Preface

Chapter 1. Introduction

Chapter 2. The structure of the network

2.1. Directed graphs
2.2. Networks and their graphic representation
2.3. Structural properties of the network
2.4. Summary

Chapter 3. Marked networks

3.1. Network dynamics
3.2. Network limitations
3.3. Network lifetime
3.4. Characteristic network constructions
3.5. Modeling with the use of marked networks
3.6. Summary

Chapter 4. Generalized networks

4.1. Network dynamics
4.2. Modeling using generalized networks
4.3. Summary

Chapter 5. Analysis of generalized networks

5.1. Availability graphs
5.2. Coverage graphs
5.3. Graphs of strongly consistent components
5.4. symmetries
5.5. Permanent collections of passages
5.6. Algebraic representation of the network
5.7. Place invariants
5.8. Change invariants
5.9. Traps and latches
5.10. Network reduction methods
5.11. Summary

Chapter 6. Networks of places and transitions

6.1. Dynamics of the network of places and crossings
6.2. Modeling using a network of places and transitions
6.3. Stimulating PT-networks using generalized networks
6.4. Summary

Chapter 7. Priority networks

7.1. The dynamics of priority networks
7.2. Modeling using priority networks
7.3. Summary

Chapter 8. Time networks

8.1. Simple time networks
8.2. Compartment time networks
8.3. Modeling using time networks
8.4. Summary

Chapter 9. Analysis of time networks

9.1. Availability graphs for simple time networks
9.2. Graphs of states classes
9.3. Summary

Chapter 10. Colored networks

10.1. Wielozbiory
10.2. Non-hierarchical colored networks 10.3. Network limitations
10.4. Network lifetime
10.5. Hierarchical colored networks
10.6. Modeling using colored networks
10.7. Summary

Chapter 11. Analysis of colored networks

11.1. Availability graphs
11.2. Delivery graphs with equivalence classes
11.3. Color variations of colored networks
11.4. Summary

Chapter 12. Temporary colored networks

12.1. Time collections
12.2. Network dynamics
12.3. Modeling using temporary colored networks
12.4. Summary

Chapter 13. RTCP-networks

13.1. Non-hierarchical RTCP-networks
13.2. Hierarchical RTCP-networks
13.3. Modeling using the RTCP-network
13.4. Summary

Chapter 14. RTCP-network analysis

14.1. Availability graphs
14.2. Coverage graphs
14.3. Summary

Chapter 15. Conclusion

Dodatek A. Polish-English dictionary of terms
Appendix B. English-Polish dictionary of terms
Appendix C. Selected tools for constructing and analyzing Petri nets
Appendix D. List of symbols

Literature

Index