Skip to main content
SpringerLink
Log in

Closure properties of deterministic Petri nets

  • Contributed Papers
  • Conference paper
  • First Online:
STACS 87 (STACS 1987)

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

Included in the following conference series:

Abstract

Deterministic Petri nets, as introduced in Vidal-Naquet's thesis [V] are studied here. We investigate systematically their closure properties under the standard language theoretical operations and prove in particular that the complement of a lan-guage of a deterministic net is always the language of a Petri net — which improves on both sides Hack's result on the complementation closure of free Petri net languages [H] —.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. CARSTENSEN: "Fairness bei nebenläufigen Systemen", doctoral thesis, Universität Hamburg, september 1986

    Google Scholar 

  2. M. HACK: "Petri net languages", Comp. Struct. Group Memo 124, Project MAC, MIT, Cambridge MASS., 1975

    Google Scholar 

  3. E. PELZ: "ω-languages of Petri nets and logical sentences", proceedings of the 7th european workshop on Petri nets, Oxford, 1986

    Google Scholar 

  4. M. PARIGOT, E. PELZ: "A logical formalism for the study of finite behaviour of Petri nets", in Advances in Petri nets 1985, ed. by G. Rozenberg, Springer-Verlag, 1986

    Google Scholar 

  5. J.L. PETERSON, "Petri net theory and the modeling of systems", Prentice-Hall, Englewood Cliffs, NJ, 1981

    Google Scholar 

  6. G. ROZENBERG, R. VERRAEDT, "Subset languages of Petri nets, Part II: Closure properties", TCS 27, pp 85–108, North-Holland, 1983

    Google Scholar 

  7. G. VIDAL-NAQUET, "Deterministic Languages for Petri nets", in the proceedings of of the first european workshop on Petri nets, Strasbourg, 1980, also in Application and theory of Petri Nets, ed. by C. Girault and W. Reisig, Informatik Fachberichte 52, Springer-Verlag, 1982. This article summarizes the 5th section of his thesis: G. VIDAL-NAQUET, "Rationalité et déterminisme dans les réseaux de Petri", thèse d'Etat, Université Pierre et Marie Curie, Paris, 1981

    Google Scholar 

  8. G. VIDAL-NAQUET, personal communication, 1986

    Google Scholar 

  9. M. YOELI, T. ETZION, "Behavioral equivalence of concurrent systems", in the proceedings of the third european workshop on Petri nets, Varenna, 1982

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Lri, Cnrs U.A. 410, Université Paris-Sud, Bat. 490, F-91405, Orsay Cedex, France

    Elisabeth Pelz

Authors
  1. Elisabeth Pelz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Franz J. Brandenburg Guy Vidal-Naquet Martin Wirsing

Rights and permissions

Reprints and permissions

Copyright information

© 1987 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pelz, E. (1987). Closure properties of deterministic Petri nets. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds) STACS 87. STACS 1987. Lecture Notes in Computer Science, vol 247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0039620

Download citation

  • DOI: https://doi.org/10.1007/BFb0039620

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17219-2

  • Online ISBN: 978-3-540-47419-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation