High-level Petri Nets
Editat de Kurt Jensen, Grzegorz Rozenbergen Limba Engleză Paperback – 31 iul 1991
Preț: 363.39 lei
Preț vechi: 454.25 lei
-20%
Puncte Express: 545
Carte tipărită la comandă
Livrare economică 10-24 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540541257
ISBN-10: 354054125X
Pagini: 736
Ilustrații: X, 724 p. 6 illus.
Dimensiuni: 170 x 242 x 40 mm
Greutate: 1.24 kg
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 354054125X
Pagini: 736
Ilustrații: X, 724 p. 6 illus.
Dimensiuni: 170 x 242 x 40 mm
Greutate: 1.24 kg
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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.