Skip to main content
SpringerLink
Log in

High-Level Net Processes

  • Chapter
  • First Online:
Formal and Natural Computing

Part of the book series: Lecture Notes in Computer Science ((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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. P. Degano, J. Meseguer, and U. Montanari. Axiomatizing Net Computations and Processes. In Proc. of LICS’89, pages 175–185, 1989.

    Google Scholar 

  3. 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. 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. 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. 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. H. Ehrig, A. Merten, and J. Padberg. How to Transfer Concepts of Abstract Data Types to Petri Nets. EACTS Bulletin, 62:106–104, 1997.

    MATH  Google Scholar 

  8. J. Engelfriet. Branching Processes of Petri Nets. Acta Informatica, 28:575–591, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  9. 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. 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. 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. 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. C. Ermel and J. Padberg. Formalization of Variables in Algebraic High-Level Nets. Technical Report 97-19, Technical University Berlin, 1997.

    Google Scholar 

  14. 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. H.J. Genrich. Predicate/Transition Nets. In High-Level Petri Nets: Theory and Application, pages 3–43. Springer Verlag, 1991.

    Google Scholar 

  16. U. Goltz and W. Reisig. The Non-Sequential Behaviour of Petri Nets. In Information and Computation, volume 57, pages 125–147. Academic Press, 1983.

    MATH  MathSciNet  Google Scholar 

  17. 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. K. Hoffmann. Flexible Modellierung mit Algebraischen Higher Order Netzen. In Proceeding of the Workshop Modellierung 2001, pages 101–110.

    Google Scholar 

  19. 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. J. Meseguer and U. Montanari. Petri Nets Are Monoids. Information and Computation, 88(2):105–155, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  21. J. Meseguer, U. Montanari, and V. Sassone. On the Semantics of Place/Transition Petri Nets. Mathematical Structures in Computer Science, 7:359–397, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  22. M. Nielsen, G. Plotkin, and G. Winskel. Petri Nets, Event Structures and Domains, Part 1. Theoretical Computer Science, 13:85–108, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  23. J. Padberg. Abstract Petri Nets: A Uniform Approach and Rule-Based Refinement. PhD thesis, Technical University Berlin, 1996. Shaker Verlag.

    Google Scholar 

  24. 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. J. Padberg, H. Ehrig, and L. Ribeiro. Algebraic High-Level Net Transformation Systems. Mathematical Structures in Computer Science, 5:217–256, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  26. 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. 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. 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.

    Article  Google Scholar 

  29. R. v. Glabbeck and G. Plotkin. Configuration Structures. In Proc. 10th LICS Symposium. IEEE, 1995.

    Google Scholar 

  30. G. Winskel. Petri Nets, Algebras, Morphisms, and Compositionality. Information and Computation, 72:197–238, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  31. 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 

Download references

Author information

Authors and Affiliations

  1. Technical University of Berlin, Germany

    Hartmut Ehrig, Kathrin Hoffmann & Julia Padberg

  2. University of Pisa, Italy

    Paolo Baldan

  3. University of Paderborn, Germany

    Reiko Heckel

Authors
  1. Hartmut Ehrig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kathrin Hoffmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Julia Padberg
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Paolo Baldan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Reiko Heckel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, Technical University of Munich, Arcisstraße 21, 80333, Munich, Germany

    Wilfried Brauer

  2. Computer Science Department, Technical University of Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Hartmut Ehrig

  3. Department of Mathematics, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

  4. Turku Centre for Computer Science, Lemminkäisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ehrig, H., Hoffmann, K., Padberg, J., Baldan, P., Heckel, R. (2002). High-Level Net Processes. In: Brauer, W., Ehrig, H., Karhumäki, J., Salomaa, A. (eds) Formal and Natural Computing. Lecture Notes in Computer Science, vol 2300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45711-9_12

Download citation

  • DOI: https://doi.org/10.1007/3-540-45711-9_12

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45711-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation