Skip to main content

Infinitary partial Petri net languages and their relationship to other Petri net semantics

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

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

Included in the following conference series:

Abstract

We introduce infinitary partial languages for Petri nets and study some of their properties. Earlier results on the interrelation between various Petri net semantics for finite behaviour are shown to be valid for infinite behaviour. As a consequence step sequences and event structures of processes both can be taken as a semantics for Petri nets without any loss of information.

Via the introduction of infinite partial words it is possible to express the properties of justice and fairness in a natural way: justice can be characterized as maximality of progress and fairness as ‘fair’ conflict resolution. By this we overcome the ambiguity arising from the lack of discrimination between concurrency and non-determinism in the sequential approach.

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.

6. References

  1. Best, E.: Fairness and Conspiracies, Information Processing Letters 18 (1984)

    Google Scholar 

  2. Best, E.; Devillers, R: Sequential and Concurrent Behaviour in Petri Net Theory, to appear in TCS

    Google Scholar 

  3. Best, E.; Fernández, C.; Plünnecke, H.: Concurrent Systems and Processes, GMD-Studien Nr. 104 (1985)

    Google Scholar 

  4. Carstensen, H.: Fairness bei nebenläufigen Systemen, Dissertation, Universität Hamburg (1986)

    Google Scholar 

  5. Carstensen, H.; Valk, R.: Infinite Behaviour and Fairness in Petri Nets, LNCS 188 (1985)

    Google Scholar 

  6. Fernández,C; Nielsen,M; Thiagarajan, P.S.: Notions of Realizable Non-Sequential Processes, University of Aarhus, DAIMI PB-205(1986)

    Google Scholar 

  7. Goltz, U.; Reisig, W.: The Non-Sequential Behaviour of Petri Nets, Information and Control, Vol. 57, Nr. 2–3 (1983)

    Google Scholar 

  8. Grabowski, J.: On Partial Languages, Preprint No 40/79, Sektion Mathematik, Humboldt-Universität Berlin (1979)

    Google Scholar 

  9. Grabowski, J.: On Partial Languages, Annales Societatis Mathematicae Polonae, Serie IV, Fundamenta Informaticae IV.2. (1981)

    Google Scholar 

  10. Hoogeboom, H. J.; Rozenberg, G.: Infinitary Languages: Basic Theory and Applications to Concurrent Systems, in: de Bakker, J. W.; de Roever, W.-P.; Rozenberg, G.: Current Trends in Concurrency, LNCS 224 (1986)

    Google Scholar 

  11. Kiehn, A.: On the Inteerelation between Synchronized and Non-synchronized Behaviour of Petri Nets, to appear in EIK

    Google Scholar 

  12. Kiehn, A.: On the Concurrent Behaviour of Petri Nets, Universität Hamburg, FB Informatik, Bericht Nr. 120 (1986)

    Google Scholar 

  13. Kiehn, A.: Infinitary partial Petri net languages and their relationship to other Petri net semantics, Technische Universität München, Bericht Nr. 8705 (1987).

    Google Scholar 

  14. König, D.: Theorie der endlichen und unendlichen Graphen, Chelsea Publishing Company, New York (1935)

    Google Scholar 

  15. Lehmann D., Pnueli A., Stavi J., Impartiality, Justice and Fairness: The Ethics of Concurrent Termination, in: Even&Kairir (ed.), Proc. ICALP(1981), LNCS 115 (1981)

    Google Scholar 

  16. Merceron, A.: Fair Processes, 7th European Workshop on Application and Theory of Petri Nets, Oxford (1986)

    Google Scholar 

  17. Mazurkiewicz, A.: Complete Processes and Inevitability, University of Leiden, Report No. 86-06 (1986)

    Google Scholar 

  18. Nielsen, M.; Plotkin, G.; Winskel, G.: Petri Nets, Event Structures and Domains, TCS 13 (1981)

    Google Scholar 

  19. Nivat, M.: On the Synchronization of Processes, INRIA Rap. No. 3 (1980)

    Google Scholar 

  20. Pratt, V.R.: On the Composition of Processes, Proceedings of the Ninth Annual ACM 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.: Petri Nets, EATCS Monographs on Theoretical Computer Science, Springer-Verlag (1985)

    Google Scholar 

  23. Reisig, W.: On the Semantics of Petri Nets, Formel Models in Programming, IFIP (1985)

    Google Scholar 

  24. Rozenberg,G.; Verraedt, R.: Subset Languages of Petri Nets, TCS 26 (Part 1) and TCS 27 (Part 2) (1983)

    Google Scholar 

  25. Staiger, L.: Research in the Theory of ω-Languages, EIK 23 (1987)

    Google Scholar 

  26. Starke, P.: Processes in Petri Nets, LNCS 117 (1981)

    Google Scholar 

  27. Starke,P.: Processes in Petri Nets, EIK 17, (1981)

    Google Scholar 

  28. Valk,R.: Infinite Behaviour of Petri Nets, TCS 25 (1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Grzegorz Rozenberg

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kiehn, A. (1988). Infinitary partial Petri net languages and their relationship to other Petri net semantics. In: Rozenberg, G. (eds) Advances in Petri Nets 1988. APN 1987. Lecture Notes in Computer Science, vol 340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50580-6_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-50580-6_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50580-8

  • Online ISBN: 978-3-540-46059-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics