Advertisement

High-Level Net Processes

  • Hartmut Ehrig
  • Kathrin Hoffmann
  • Julia Padberg
  • Paolo Baldan
  • Reiko Heckel
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2300)

Abstract

The notion of processes for low-level Petri nets based on occurrence nets is well known and it represents the basis for the study of the non-sequential behavior of Petri nets. Processes for high-level nets N are often defined as processes of the low level net Flat(N) which is obtained from N via a construction called “flattening”. In this paper we define high-level processes for high-level nets based on a suitable notion of high-level occurrence nets. The flattening of a high-level occurrence net is in general not a low-level occurrence net, due to so called “assignment conflicts” in the high-level net. The main technical result is a syntactical characterization of assignment conflicts. But the main focus of this paper is a conceptual discussion of future perspectives of high-level net processes includingc oncurrency and data type aspects. Specifically, in the second part of the paper, we discuss possible extensions of high-level net processes, which are formally introduced for algebraic high-level nets in the first part of this paper. Of special interest are high-level processes with data type behavior, amalgamation, and other kinds of constructions, which are essential aspects for a proposed component concept for high-level nets.

Keywords

Input Place Component Concept Dine Philosopher Process Modeling Technique Assignment Conflict 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BCEH01]
    P. Baldan, A. Corradini, H. Ehrig, and R. Heckel. Compositional Modeling of Reactive Systems Using Open Nets. In Proc. of CONCUR’01, 2001. To appear.Google Scholar
  2. [DMM89]
    P. Degano, J. Meseguer, and U. Montanari. Axiomatizing Net Computations and Processes. In Proc. of LICS’89, pages 175–185, 1989.Google Scholar
  3. [EGH92]
    H. Ehrig, M. Groβe-Rhode, and A. Heise. Specification Techniques for Concurrent and Distributed Systems. Technical Report 92/5, Technical University of Berlin, jan. 1992. Invited paper for 2nd Maghr. Conference on Software Engineering and Artificial Intelligence, Tunis, 1992.Google Scholar
  4. [EGP99]
    H. Ehrig, M. Gajewsky, and F. Parisi-Presicce. High-Level Replacement Systems with Applications to Algebraic Specifications and Petri Nets, chapter 6, pages 341–400. Number 3: Concurrency, Parallelism, and Distribution in Handbook of Graph Grammars and Computingb y Graph Transformations. World Scientific, 1999.Google Scholar
  5. [EM85]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1: Equations and Initial Semantics, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1985.Google Scholar
  6. [EM90]
    H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 2: Module Specifications and Constraints, volume 21 of EATCS Monographs on Theoretical Computer Science. Springer Verlag, Berlin, 1990.Google Scholar
  7. [EMP97]
    H. Ehrig, A. Merten, and J. Padberg. How to Transfer Concepts of Abstract Data Types to Petri Nets. EACTS Bulletin, 62:106–104, 1997.zbMATHGoogle Scholar
  8. [Eng91]
    J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica, 28:575–591, 1991.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [EO01a]
    H. Ehrig and F. Orejas. A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques. In Proc. GTVMT 2001, ICALP 2001 Satellite Workshops, pages 201–228, Heraclion, Greece, 2001.Google Scholar
  10. [EO01b]
    H. Ehrig and F. Orejas. A Generic Component Concept for Integrated Data Type and Process Specification Techniques. Technical report, Technische Universität Berlin, FB Informatik, 2001.Google Scholar
  11. [EP97a]
    H. Ehrig and J. Padberg. A Uniform Approach to Petri Nets. In Ch. Freksa, M. Jantzen, and R. Valk, Editors, Foundations of Computer Science: Potential— Theory— Cognition, pages 219–231. Springer, LNCS 1337, 1997.Google Scholar
  12. [EP97b]
    H. Ehrig and J. Padberg. Introduction to Universal Parametrized Net Classes. In H. Weber, H. Ehrig, and W. Reisig, Editors, MoveOn-Proc. der DFG-Forschergruppe“Petrinetz-Technologie”, pages 39–51, Technische Universität Berlin, 1997. Forschungsberichte des Fachbereichs Informatik.Google Scholar
  13. [EP97c]
    C. Ermel and J. Padberg. Formalization of Variables in Algebraic High-Level Nets. Technical Report 97-19, Technical University Berlin, 1997.Google Scholar
  14. [EPR94]
    H. Ehrig, J. Padberg, and L. Ribeiro. Algebraic High-Level Nets: Petri Nets Revisited. In Recent Trends in Data Type Specification, pages 188–206. Springer Verlag, 1994. Lecture Notes in Computer Science 785.Google Scholar
  15. [Gen91]
    H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3–43. Springer Verlag, 1991.Google Scholar
  16. [GR83]
    U. Goltz and W. Reisig. The Non-Sequential Behaviour of Petri Nets. In Information and Computation, volume 57, pages 125–147. Academic Press, 1983.zbMATHMathSciNetGoogle Scholar
  17. [Hof00]
    K. Hoffmann. Run Time Modification of Algebraic High Level Nets and Algebraic Higher Order Nets Using Folding and Unfolding Construction. In Proceeding of the 3rd Internation Workshop Communication Based Systems, pages 55–72. Kluwer Academic Publishers, 2000.Google Scholar
  18. [Hof01]
    K. Hoffmann. Flexible Modellierung mit Algebraischen Higher Order Netzen. In Proceeding of the Workshop Modellierung 2001, pages 101–110.Google Scholar
  19. [Jen92]
    K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, volume 1: Basic Concepts. Springer Verlag, EATCS Monographs in Theoretical Computer Science Edition, 1992.Google Scholar
  20. [MM90]
    J. Meseguer and U. Montanari. Petri Nets Are Monoids. Information and Computation, 88(2):105–155, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  21. [MMS97]
    J. Meseguer, U. Montanari, and V. Sassone. On the Semantics of Place/Transition Petri Nets. Mathematical Structures in Computer Science, 7:359–397, 1997.zbMATHCrossRefMathSciNetGoogle Scholar
  22. [NPW81]
    M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85–108, 1981.zbMATHCrossRefMathSciNetGoogle Scholar
  23. [Pad96]
    J. Padberg. Abstract Petri Nets: A Uniform Approach and Rule-Based Refinement. PhD thesis, Technical University Berlin, 1996. Shaker Verlag.Google Scholar
  24. [PE01]
    J. Padberg and H. Ehrig. Introduction to Parametrized Net Classes. In H. Ehrig, G. Juhás, J. Padberg, and G. Rozenberg, Editors, Advances in Petri Nets: Unifying Petri Nets, LNCS. Springer, 2001.Google Scholar
  25. [PER95]
    J. Padberg, H. Ehrig, and L. Ribeiro. Algebraic High-Level Net Transformation Systems. Mathematical Structures in Computer Science, 5:217–256, 1995.zbMATHMathSciNetCrossRefGoogle Scholar
  26. [PJE+01]
    J. Padberg, L. Jansen, H. Ehrig, E. Schnieder, and R. Heckel. Cooperability in Train Control Systems Specification of Scenarios Using Open Nets. Journal of Integrated Design and Process Technology, 5:3–21, 2001.Google Scholar
  27. [Roz87]
    G. Rozenberg. Behaviour of Elementary Net Systems. In W. Brauer, W. Reisig, and G. Rozenberg, Editors, Advances in Petri Nets 1986, pages 60–94. Springer Verlag Berlin, LNCS 254, 1987.Google Scholar
  28. [vdA98]
    W.M.P. van der Aalst. The Application of Petri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8:21–66, 1998.CrossRefGoogle Scholar
  29. [vGP95]
    R. v. Glabbeck and G. Plotkin. Configuration Structures. In Proc. 10th LICS Symposium. IEEE, 1995.Google Scholar
  30. [Win87]
    G. Winskel. Petri Nets, Algebras, Morphisms, and Compositionality. Information and Computation, 72:197–238, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  31. [Win88]
    G. Winskel. Event Structures. In W. Brauer, W. Reisig, and G. Rozenberg, Editors, Petri Nets: Applications and Relationships to Other Models of Concurrency, pages 324–392. Springer, LNCS 255, 1988.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Hartmut Ehrig
    • 1
  • Kathrin Hoffmann
    • 1
  • Julia Padberg
    • 1
  • Paolo Baldan
    • 2
  • Reiko Heckel
    • 3
  1. 1.Technical University of BerlinGermany
  2. 2.University of PisaItaly
  3. 3.University of PaderbornGermany

Personalised recommendations