Hierarchical high level petri nets for complex system analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 815 LNCS, Issue , 1994, Pages 119-138

  Buchholz, Peter ^a  

^a TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SPECIFICATIONS;

BOTTOM-UP DESIGN; CONCURRENT SYSTEMS; DIVIDE-AND-CONQUER APPROACH; FUNCTIONAL ASPECTS; HIGH-LEVEL PETRI NETS; MODULAR SPECIFICATIONS; REACHABILITY SET; REDUCTION TECHNIQUES;

PETRI NETS;

EID: 84938305621     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-58152-9_8     Document Type: Conference Paper

References (20)

1. J. Billington; Extensions to Coloured Petri Nets; in Proc. of the Third Int. workshop on Petri Nets and Performance Models, kyoto 1989.
2. T. Bolognesi, S.A. Smolka; Fundamental Results for the Verification of Observational Equivalence: A Survey; in: H. Rudin, C. West (eds.), Protocol Specification, Testing and Verification VII, North Holland (1987) 165-179.
3. W. Brauer, R. Gold, W. Vogler; A Survey of Behaviour and Equivalence Preserving Refinements of Petri Nets; in G. Rozenberg (ed.), Advances in Petri Nets 90, LNCS 424, Springer 1990, pp. 1-46.
4. P. Buchholz; A Hierarchical View of GCSPNs and its Impact on Qualitative and Quantitative Analysis; Journal of Parallel and Distributed Computing, vol. 15, no. 2, July 1992, pp. 207-224.
5. P. Buchholz; Hierarchies in Colored GSPNs; in M. Ajmone Marsan (ed.), Application and Theory of Petri Nets 1993, LNCS 691, Springer 1993, pp. 106-125.
6. G. Chehaibar; Use of Reentrant Nets in Modular Analysis of Colored Nets; in K. Jensen, G. Rozenberg (ed.), High-Level Petri Nets. Theory and Application, Springer 1991.
7. R. Fehling; A Concept of Hierarchical Petri Nets with Building Blocks; in G. Rozenberg (ed.), Advances in Petri Nets 93, LNCS 674, Springer 1993.
8. H.J. Genrich, K. Lautenbach; System modelling with high-level Petri nets; Theoretical Computer Science, vol. 13, 1981, pp. 109-136.
9. J.F. Groote, F. Moiler; Verification of Parallel Systems via Decomposition; in W.R. Cleaveland (ed.), CONCUR 92, LNCS 630, Springer 1992, pp. 62-76.
10. M.S. Haddad; A Reduction Theory for colored Nets; in G. Rozenberg (ed.), Advances in Petri Nets 90, LNCS 424, Springer 1990, pp. 209-235.
11. P. Huber, K. Jensen, R.M. Shapiro; Hierarchies in colored Petri Nets; in G. Rozenberg (ed.), Advances in Petri Nets 90, LNCS 483, Springer 1990, pp. 313-341.
12. K. Jensen; Coloured Petri Nets and the invariant-method; Theoretical Computer Science, Vol. 14, 1981, pp. 317-336
13. K. Jensen; Coloured Petri Nets: A High Level Language for System Design and Analysis; in G. Rozenberg (ed.), Advances in Petri Nets 90, LNCS 483, Springer 1990, pp. 342-416.
14. S.S. Lam, A.U. Shankar; Protocol Verification via Projections; IEEE Trans. on Softw. Eng., Vol. 10, 1984, pp. 325-342.
15. R. Milner; Communication and Concurrency; Prentice Hall, 1989.
16. J.L. Peterson; Petri Net Theory and the Modeling of Systems; Prentice Hall, Englewood Cliffs, 1981.
17. W. Reisig; Petri Nets, An Introduction; EATCS Monographs on Theoretical Computer Science, Springer 1985.
18. Y. Souissi, G. Memmi; Composition of Nets via a Communication Medium; in G. Rozenberg (ed.), Advances in Petri Nets 91, LNCS 483, Springer 1992, pp. 457-470.
19. A. Valmari, M. Clegg; Reduced Labelled Transition Systems Save Verification Effort; in W.R. Cleaveland (ed.), CONCUR 91, LNCS 527, Springer 1991, pp. 526-540.
20. A. Valmari; Compositional State Space Generation; in G. Rozenberg (ed.), Advances in Petri Nets 93, LNCS 674, Springer 1993, pp. 427-457.