Skip to main content

Petri net systems and their closure properties

  • Conference paper
  • First Online:
Advances in Petri Nets 1989 (APN 1988)

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

Included in the following conference series:

Abstract

We introduce Petri net systems as a means for a hierachical development of concurrent systems. A Petri net system is a finite family of place/transition nets which may call each other in a certain way. We study the generating power of these systems and prove closure properties of the class of languages accepted by them.

This work has been supported by Esprit Project No. 283.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

5. References

  1. André, C.: "Behaviour of a Place-Transition net on a Subset of Transitions" in [Girault/Reisig 82], 1982

    Google Scholar 

  2. Baumgarten, B.: "On Internal and External Characterizations of PT-Net Building Block Behaviour", Proceedings of the 7th European Workshop on Application and Theory of Petri Nets, Oxford 1986

    Google Scholar 

  3. Best, E:;Devillers,R.: "Sequential and Concurrent Behaviour in Petri Net Theory", TCS Vol. 55, no. 1, 1987

    Google Scholar 

  4. Brauer, W.; Reisig, W.; Rozenberg, G.(eds.): "Petri Nets: Central Models and Their Properties", LNCS 254, 1987

    Google Scholar 

  5. Castellano, L.; De Michelis, G.; Pomello, L.: "Concurrency vs. Interleaving: an Instructive Example", EATCS Bulletin 31, 1987

    Google Scholar 

  6. Cherkasova, L.A.; Kotov, V.E.: "Structured Nets", in: Gruska, J.; Chytil, M. (ed.): "Mathematical Foundations of Computer Science 1981"; LNCS 118 (1981), pp. 242–251

    Google Scholar 

  7. Girault, C.; Reisig, W. (eds): Application and Theory of Petri Nets, IFB 52, 1982

    Google Scholar 

  8. Gischer, G. L.: "Partial Orders and the Axiomatic Theory of Shuffle", Department of Computer Science, Stanford University, 1984

    Google Scholar 

  9. Goltz, U.: "Ueber die Darstellung von CCS-Programmen durch Petrinetze", GMD, Dissertation, Rheinisch-Westfälische Technische Hochschule 1988

    Google Scholar 

  10. Goltz, U.; Reisig, W.: "The Non-sequential Behaviour of Petri Nets", Information and Control no. 2–3, 1983

    Google Scholar 

  11. Grabowski, J.: "On Partial Languages", Preprint no. 40/79, Sektion Mathematik, Humboldt-Universität Berlin, 1979

    Google Scholar 

  12. Grabowski, J.: "On Partial Languages", Fundamenta Informaticae IV.2, 1981

    Google Scholar 

  13. Hopcroft, J. E.; Ullman, J. D.: "Introduction to Automata Theory, Languages and Computation", Addison-Wesley Publishing Company, 1979

    Google Scholar 

  14. Jantzen, M.: "Language Theory of Petri Nets", in [Brauer et al. 87], 1987

    Google Scholar 

  15. Kiehn, A.: "On the Interrelation between Synchronized and Non-synchronized Behaviour of Petri Nets", EIK 1–2/88

    Google Scholar 

  16. Kiehn, A.: “A Structuring Mechanism for Petri Nets”, Technische Universität München, Bericht Nr. TUM-I8902, 1989

    Google Scholar 

  17. Kotov, V.E.: "An Algebra for Parallelism Based on Petri nets", in: Winkowski, J. (ed.): "Mathematical Foundations of Computer Science 1978", LNCS 64, 1978, pp. 39–54

    Google Scholar 

  18. Müller, K.: "Constructable Petri Nets", EIK 21, 1985

    Google Scholar 

  19. Peterson, J.: "Petri Net Theory and the Modeling of Systems", Prentice-Hall 1981

    Google Scholar 

  20. Pratt, V. R.: "On the Composition of Processes", Proceedings of the 9th Annual Symposium on Principles of Programming Languages 1982

    Google Scholar 

  21. Pratt, V. R.: "Modelling Concurrency with Partial Orders", Journal of Parallel Programming, vol. 15, no. 1, 1986

    Google Scholar 

  22. Reisig, W.: "Recursive Nets", in [Girault/Reisig 82], 1982

    Google Scholar 

  23. Reisig, W.: "Petri Nets", EATCS Monographs on Theoretical Computer Science, vol. 5, 1985

    Google Scholar 

  24. Suzuki, I.; Murata, T.: "Stepwise Refinements of Transitions and Places", in [Girault/Reisig 82], 1982

    Google Scholar 

  25. Taubner, D. A.: "The Representation of Abstract Programs by Automata and Petri Nets", Dissertation, Technische Universität München, 1988

    Google Scholar 

  26. Ullrich, G.: "Der Entwurf von Steuerstrukturen for parallele Abläufe mit Hilfe von Petri-Netzen", Universität Hamburg, Bericht Nr. 36, 1977

    Google Scholar 

  27. Valette, R.: "Analysis of Petri Nets by Stepwise Refinement", Journal of Computer and System Science 18, 1979

    Google Scholar 

  28. Vogler, W.: "Behaviour Preserving Refinements of Petri Nets" 12th Workshop on Graph Theoretic Concepts in Computer Science 1986

    Google Scholar 

  29. Vogler, W.: "Failures Semantics and Deadlocking of Modular Petri Nets", unpublished manuscript, 1987

    Google Scholar 

  30. Voss, K.: Interface as a Basic Concept for System Specification and Verification" in [Voss et al. 87], 1987

    Google Scholar 

  31. Voss, K.; Genrich, H., Rozenberg, G: "Concurrency and Nets", Springer-Verlag, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiehn, A. (1990). Petri net systems and their closure properties. In: Rozenberg, G. (eds) Advances in Petri Nets 1989. APN 1988. Lecture Notes in Computer Science, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52494-0_35

Download citation

  • DOI: https://doi.org/10.1007/3-540-52494-0_35

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52494-6

  • Online ISBN: 978-3-540-46998-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics