Skip to main content
SpringerLink
Log in

Hierarchical High Level Petri Nets for complex system analysis

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1994 (ICATPN 1994)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 815))

Included in the following conference series:

Abstract

The class of Hierarchical High Level Petri Nets (HHPNs) is introduced. HHPNs provide a framework for a modular specification of complex parallel and concurrent systems which supports top-down and bottom-up design. Apart from specification convenience HHPNs can be analysed very efficiently according to functional aspects of the modelled system. Analysis is based on a divide and conquer approach combined with behaviour preserving reduction techniques on subsets of the reachability set. The complexity of an analysis on the reachability set of the net can often be reduced by several orders of a magnitude by considering only small parts of the complex reachability set in a single analysis step and performing behaviour preserving reductions before composing subsets of the reachability set.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Billington; Extensions to Coloured Petri Nets; in Proc. of the Third Int. Workshop on Petri Nets and Performance Models, Kyoto 1989.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    MathSciNet  Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  8. H.J. Genrich, K. Lautenbach; System modelling with high-level Petri nets; Theoretical Computer Science, vol. 13, 1981, pp. 109–136.

    Article  Google Scholar 

  9. J.F. Groote, F. Moller; Verification of Parallel Systems via Decomposition; in W.R. Cleaveland (ed.), CONCUR 92, LNCS 630, Springer 1992, pp. 62–76.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  12. K. Jensen; Coloured Petri Nets and the invariant-method; Theoretical Computer Science, Vol. 14, 1981, pp. 317–336

    Article  Google Scholar 

  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.

    Google Scholar 

  14. S.S. Lam, A.U. Shankar; Protocol Verification via Projections; IEEE Trans. on Softw. Eng., Vol. 10, 1984, pp. 325–342.

    Google Scholar 

  15. R. Milner; Communication and Concurrency; Prentice Hall, 1989.

    Google Scholar 

  16. J.L. Peterson; Petri Net Theory and the Modeling of Systems; Prentice Hall, Englewood Cliffs 1981.

    Google Scholar 

  17. W. Reisig; Petri Nets, An Introduction; EATCS Monographs on Theoretical Computer Science, Springer 1985.

    Google Scholar 

  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.

    Google Scholar 

  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.

    Google Scholar 

  20. A. Valmari; Compositional State Space Generation; in G. Rozenberg (ed.), Advances in Petri Nets 93, LNCS 674, Springer 1993, pp. 427–457.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Informatik IV, Universität Dortmund, D-44221, Dortmund, Germany

    Peter Buchholz

Authors
  1. Peter Buchholz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Valette

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchholz, P. (1994). Hierarchical High Level Petri Nets for complex system analysis. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_8

Download citation

  • DOI: https://doi.org/10.1007/3-540-58152-9_8

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58152-9

  • Online ISBN: 978-3-540-48462-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation