Advertisement

Hierarchies in coloured petri nets

  • Peter Huber
  • Kurt Jensen
  • Robert M. Shapiro
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 483)

Abstract

The paper shows how to extend Coloured Petri Nets with a hierarchy concept. The paper proposes five different hierarchy constructs, which allow the analyst to structure large CP-nets as a set of interrelated subnets (called pages). The paper discusses the properties of the proposed hierarchy constructs, and it illustrates them by means of two examples. The hierarchy constructs can be used for theoretical considerations, but their main use is to describe and analyse large real-world systems. All of the hierarchy constructs are supported by the editing and analysis facilities in the CPN Palette tool package (see [1–5]).

Keywords

high-level nets Coloured Petri Nets structuring mechanisms hierarchies re-usable components subnets 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Reference list

  1. [1]
    K. Albrect, K. Jensen & R.M. Shapiro: CPN Palette. A Tool Package Supporting the Use of Coloured Petri Nets. The Petri Net Newsletter, April 1989.Google Scholar
  2. [2]
    K. Jensen: CPN ML. Specification paper for the CPN Palette — Part 1. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.Google Scholar
  3. [3]
    P. Huber: Hierarchies in Coloured Petri Nets. Specification paper for the CPN Palette — Part 2. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.Google Scholar
  4. [4]
    K. Jensen and S. Christensen: CPN Editor. Specification paper for the CPN Palette — Part 3. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.Google Scholar
  5. [5]
    K. Jensen and S. Christensen: CPN Simulator. Specification paper for the CPN Palette — Part 4. Meta Software Corporation, Cambridge, Massachusetts, USA, 1989.Google Scholar
  6. [6]
    W. Reisig: Petri Nets in Software Engineering. In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Petri Nets: Applications and Relationship to Other Models of Concurrency, Advances in Petri Nets 1986-Part II, Lecture Notes in Computer Science, vol. 255, Springer-Verlag 1987, 207–247.Google Scholar
  7. [7]
    H. Oberquelle: Human-machine Interaction and Role/Function/Action Nets. In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Petri Nets: Applications and Relationships to Other Models of Concurrency, Advances in Petri Nets 1986-Part II, Lecture Notes in Computer Science, vol. 255, Springer-Verlag 1987, 207–247.Google Scholar
  8. [8]
    H.J. Genrich and K. Lautenbach: System Modelling with High-level Petri Nets Theoretical Computer Science 13. 1981, 109–136.Google Scholar
  9. [9]
    H.J. Genrich: Predicate/Transition Nets In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I, Lecture Notes in Computer Science, vol. 254, Springer-Verlag 1987, 207–247.Google Scholar
  10. [10]
    K. Jensen: Coloured Petri Nets. A Way to Describe and Analyse Real World Systems — Without Drowning in Unnecessary Details. Proceedings of the 5'th International Conference on Systems Engineering, Dayton 1987, New York: IEEE, 395–401.Google Scholar
  11. [11]
    K. Jensen: Coloured Petri Nets. In: W. Brauer, W. Reisig and G. Rozenberg (eds.): Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part I, Lecture Notes in Computer Science, vol. 254, Springer-Verlag 1987, 248–299.Google Scholar
  12. [12]
    K. Jensen: Informal Introduction to Coloured Petri Nets. Chapter 1 of a three-volume book on CP-nets. The book will be published by Springer-Verlag in the series: EATCS Monographs on Theoretical Computer Science.Google Scholar
  13. [13]
    D.A. Marca and C.L. McGowan: SADT. McGraw-Hill, New York, 1988.Google Scholar
  14. [14]
    E. Yourdon: Managing the System Life Cycle. Yourdon Press, 1982.Google Scholar
  15. [15]
    D. Harel: Statecharts: A Visual Formalism for Complex Systems. In: Science of Computer Programming, Vol. 8, North-Holland 1987, 231–274.Google Scholar
  16. [16]
    H.J. Genrich, K. Lautenbach and P.S. Thiagarajan: Elements of General Net Theory. In: G. Goos and J. Hartmanis (eds.): Net Theory and Applications, Lecture Notes in Computer Science, vol. 84, Springer-Verlag 1980, 248–299.Google Scholar
  17. [17]
    R.M. Shapiro and P. Hardt: The Impact of Computer Technology. A Case Study: The Dairy Industry. GMD Internal Report, ISF-76-11, 1976.Google Scholar
  18. [18]
    R.R. Razouk and M.T. Rose: Verifying Partial Correctness of Concurrent Software using Contour/Transition Nets. In: Proceedings of the Hawaii International Conference on System Sciences, 1986.Google Scholar
  19. [19]
    H.J. Genrich and R.M. Shapiro: A Diagram Editor for Line Drawing with Inscriptions. Proceedings of the 3'rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, 1982, 193–212.Google Scholar
  20. [20]
    Network Tool Net: System Analysis and Simulation with Petri-Nets. PSI Gesellschaft für Prozessteuerungs-und Informationssysteme, Berlin, undated, 23 pages.Google Scholar
  21. [21]
    H. Oberquelle: Some Concepts for Studying Flow and Modification of Actors and Objects in High-level Nets. Proceedings of the 3'rd European Workshop on Applications and Theory of Petri Nets, Varenna, Italy, 1982, 343–363.Google Scholar
  22. [22]
    A. Kiehn: A Structuring Mechanism for Petri Nets. Institut für Informatik der Technischen Universität München, 1988, 127 pages.Google Scholar
  23. [23]
    K.M. van Hee, L.J. Somers, and M. Voorhoeve: Executable Specifications for Distributed Information Systems. In: E.D. Falkenberg and P. Lindgreen (eds.): Information System Concepts: An In-depth Analysis, North Holland, 1989, 139–156Google Scholar
  24. [24]
    B. Cousin et. al.: Validation of a Protocol Managing a Multi-token Ring Architecture. Proceedings of the 9'th European Workshop on Applications and Theory of Petri Nets, Vol. II, Venice 1988.Google Scholar
  25. [25]
    C. Girault, C. Chatelain and S. Haddad: Specification and Properties of a Cache Coherence Protocol Model. In: G. Rozenberg (ed.): Advanced in Petri Nets 1987, Lecture Notes of Computer Science, vol. 266, Springer-Verlag, 1987, 1–20.Google Scholar
  26. [26]
    S. Haddad.: Generalization of Reduction Theory to Coloured Nets. Proceedings of the 9'th European Workshop on Applications and Theory of Petri Nets, Vol. II, Venice 1988.Google Scholar
  27. [27]
    P. Huber, A.M. Jensen, L.O. Jepsen and K. Jensen: Reachability Trees for High-level Petri Nets. Theoretical Computer Science 45 (1986), 261–292.Google Scholar
  28. [28]
    K. Jensen: How to Find Invariants for Coloured Petri Nets. In: J. Gruska, M. Chytill (eds.): Mathematical Foundations of Computer Science 1981, Lecture Notes in Computer Science vol. 118, Springer-Verlag 1981, 327–338.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Peter Huber
    • 1
  • Kurt Jensen
    • 1
    • 2
  • Robert M. Shapiro
    • 1
  1. 1.Meta Software CorporationCambridgeUSA
  2. 2.Computer Science DepartmentAarhus UniversityAarhus CDenmark

Personalised recommendations