High-level Petri nets are now widely used in both theoretical analysis and practical modelling of concurrent systems. The main reason for the success of this class of net models is that they make it possible to obtain much more succinct and manageable de scriptions than can be obtained by means of low-level Petri nets-while, on the other hand, they still offer a wide range of analysis methods and tools. The step from low-level nets to high-level nets can be compared to the step from assembly languages to modem programming languages with an elaborated type concept. In low-level nets there is only one kind of token and this means that the state of a place is described by an integer (and in many cases even by a boolean value). In high-level nets each token can carry complex information which, e. g. , may describe the entire state of a process or a data base. Today most practical applications of Petri nets use one of the different kinds of high-level nets. A considerable body of knowledge exists about high-level Petri nets this includes theoretical foundations, analysis methods and many applications. Unfortunately, the papers on high-level Petri nets have been scattered throughout various journals and collections. As a result, much of this knowledge is not readily available to people who may be interested in using high-level nets.
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
6
6 s/w Abbildungen
X, 724 p. 6 illus.
Dateigröße
ISBN-13
978-3-642-84524-6 (9783642845246)
DOI
10.1007/978-3-642-84524-6
Schweitzer Klassifikation
Section A: Predicate / Transition Nets and Coloured Petri Nets.- 1. Predicate / Transition Nets.- 2. Coloured Petri Nets: A High Level Language for System Design and Analysis.- Section B: High-level Nets and Abstract Data Types.- 3. Many-sorted High-level Nets.- 4. Petri Nets and Algebraic Specifications.- 5. Types and Modules for Net Specifications.- 6. OBJSA Nets: A Class of High-level Nets Having Objects as Domains.- Section C: Hierarchical High-level Nets.- 7. Hierarchies in Coloured Petri Nets.- Section D: Analysis by Means of Invariants.- 8. Analysing Nets by the Invariant Method.- 9. Linear Invariants in Commutative High Level Nets.- 10. Generalized Inverses and the Calculation of Symbolic Invariants for Coloured Petri Nets.- Section E: Analysis by Means of Reachability Graphs.- 11. Reachability Trees for High-level Petri Nets.- 12. Parameterized Reachability Trees for Predicate/Transition Nets.- 13. On Well-Formed Coloured Nets and Their Symbolic Reachability Graph.- Section F: Analysis by Means of Transformations.- 14. A Reduction Theory for Coloured Nets.- 15. Equivalence Transformations of PrT-Nets.- Section G: Analysis of Stochastic Nets.- 16. Stochastic High-level Petri Nets and Applications.- 17. Regular Stochastic Petri Nets.- 18. Automated Construction of Compound Markov Chains from Generalized Stochastic High-level Petri Nets.- 19. Stochastic Well-Formed Coloured Nets and Multiprocessor Modelling Applications.- Section H: Applications of High-level Nets.- 20. An Example of Modelling and Evaluation of a Concurrent Program Using Coloured Stochastic Petri Nets: Lamport's Fast Mutual Exclusion Algorithm.- 21. PROTEAN: A High-level Petri Net Tool for the Specification and Verification of Communication Protocols.- 22. Specification and Properties of a CacheCoherence Protocol Model.- 23. Use of Reentrant Nets in Modular Analysis of Colored Nets.- 24. Modeling, Validation and Software Implementation of Production Systems Using High Level Petri Nets.- 25. PROTOB: An Object Oriented Methodology for Developing Discrete Event Dynamic Systems.- 26. An Integrated Software Development Methodology Based on Hierarchical Colored Petri Nets.- 27. Validation of a VLSI Chip Using Hierarchical Colored Petri Nets.- Section I: Computer Tools for High-level Nets.- 28. Computer Tools for High-level Petri Nets.- Petri Net Activities.- Contributing Authors.
