Skip to main content

Subset Languages of Petri Nets

  • Conference paper
Applications and Theory of Petri Nets

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 66))

Abstract

Formal language theory is used to some extent in the investigation of properties of Petri nets (see, e.g. [H], [JV] and [P]). In most applications of language theory for Petri nets one considers completely sequentialized versions of Petri nets only. That is one assumes that a Petri net has one central run place which allows only a single transition to fire at a time; any sequence of such firings is called a firing sequence and the language of a Petri net consists of the set of all firing sequences (or only of those firing sequences that lead to one of the finite number of final markings).

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. W. Brauer, Net Theory and Applications, Proceedings of the Advanced Course on General Net Theory of Processes and Systems, Hamburg 1979, Lecture Notes in Computer Science 84, Springer-Verlag, Berlin-Heidelberg-New York.

    Google Scholar 

  2. S. Crespi-Reghizzi and D. Mandrioli, Petri nets and Szilard languages, Information and Control 33, (1977), 177–192.

    Article  MathSciNet  MATH  Google Scholar 

  3. H.J. Genrich, K. Lautenbach, P.S. Thiagarajan, Elements of general net theory, in [B] 21–163.

    Google Scholar 

  4. M. Hack, Petri net languages, Computations Structures Group Memo 124, Project MAC, Massachusetts Institute of Technology, Cambridge, Massachusetts, (June 1975).

    Google Scholar 

  5. JV] M. Jantzen, R. Valk, Formal properties of place/transition nets, in [B] 165–223.

    Google Scholar 

  6. J. Peterson, Petri Net Theory and the Modelling of Systems, Prentice Hall, Englewood Cliffs 1981.

    MATH  Google Scholar 

  7. A. Salomaa, Formal languages, Academic Press, New York 1973.

    MATH  Google Scholar 

  8. P. Starke, Petri Netze, YEB Deutscher Verslag der Wissenschaften, Berlin 1980.

    MATH  Google Scholar 

  9. G. Rozenberg and R. Verraedt, Subset languages of Petri nets, Part I. The relationship to string languages and normal forms, Technical Report 82-08, University of Leiden, Leiden 1982.

    Google Scholar 

  10. G. Rozenberg and R. Verraedt, Subset languages of Petri nets, Part II. Closure properties, Technical Report 82-14, University of Leiden, Leiden 1982.

    Google Scholar 

  11. RV3] G. Rozenberg and R. Verraedt, Restricting the in-out structure of Petri nets, Technical Report.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1983 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rozenberg, G., Verraedt, R. (1983). Subset Languages of Petri Nets. In: Pagnoni, A., Rozenberg, G. (eds) Applications and Theory of Petri Nets. Informatik-Fachberichte, vol 66. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-69028-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-69028-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-12309-5

  • Online ISBN: 978-3-642-69028-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics