Skip to main content

About the concurrent behaviour of EN systems: Definability and closure results

  • 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:

  • 147 Accesses

Abstract

We investigate the concurrent behaviour of elementary net systems in terms of partial word languages. We obtain its definability by existential sentences of the monadic second order logic. The class of these languages of λ-free labeled EN systems is closed under conjunction, disjunction and projection but not under complementation. This implies that existential sentences of the considered logic do not necessarly define the behaviour of these EN systems. A similar study is made for unlabeled EN systems, too.

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.

References

  1. W. BRAUER, W. REISIG, G. ROZENBERG, editors, Petri Nets: Central Models and Their Properties, part 1, and, Petri Nets: Applications and Relationships to Other Models, part 2, Proceedings, Advances in petri nets 1986, LNCS 254 and 255, Springer-Verlag (1987)

    Google Scholar 

  2. J.R. BÜCHI, Weak second-order arithmetic and finite automata, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 6 (1960)

    Google Scholar 

  3. J. GRABOWSKI, On partial languages, Annales Soc. Math. Polonae, series IV: Fundamenta Informaticae IV.2 (1981)

    Google Scholar 

  4. P. GRAUBMANN, Construction of EN systems with a given trace behaviour, in Proceedings of the 8th European Workshop ... of Petri Nets, Zaragoza, 1987

    Google Scholar 

  5. M. HACK, Petri net languages, MIT — Technical report 159, (1975)

    Google Scholar 

  6. M. JANTZEN, Language theory of Petri nets, in [Bra,Rei,Roz]

    Google Scholar 

  7. A. KIEHN, On the concurrent behaviour of Petri nets, Universität Hamburg, Informatik-Bericht Nr. 120, (1986)

    Google Scholar 

  8. E. OCHMANSKI, Occurrence traces — Processes of elementary net systems, in Proceedings of the 8th European Workshop ... of Petri Nets, Zaragoza, 1987

    Google Scholar 

  9. M. PARIGOT, E. PELZ, A logical approach of Petri net languages, TCS 39 (1985)

    Google Scholar 

  10. E. PELZ, Infinitary languages of Petri nets and logical sentences, Advances in Petri nets 1987, LNCS 266, ed. by G. Rozenberg, Springer-Verlag (1987)

    Google Scholar 

  11. J.L. PETERSON, Petri net theory and the modeling of systems, Prentice-Hall, (1981)

    Google Scholar 

  12. P. STARKE, Processes in Petri nets, in Fundamentals of Computation theory, LNCS 117, ed. by F. Gécseg, Springer-Verlag (1981) also as full version: Elektronische Informationsverarbeitung und Kybernetik EIK 17, 8/9, (1981)

    Google Scholar 

  13. G. ROZENBERG, Behaviour of elementary net systems, in [Bra,Rei,Roz]

    Google Scholar 

  14. P.S. THIAGARAJAN, Elementary net systems, in [Bra,Rei,Roz]

    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

Pelz, E. (1990). About the concurrent behaviour of EN systems: Definability and closure results. 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_37

Download citation

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

  • 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