Skip to main content
SpringerLink
Log in

Infinite behaviour of deterministic petri nets

  • Communications
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1988 (MFCS 1988)

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

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: Fairneß bei Petrinetzen mit unendlichem Verhalten; Universität Hamburg, Fachbereich Informatik, Bericht Nr. 93, IFI-HH-B-93/82, 1982.

    Google Scholar 

  2. H. Carstensen: Fairneß bei nebenläufigen Systemen — Eine Untersuchung am Modell der Petrinetze; Universität Hamburg, Fachbereich Informatik, Bericht Nr. 126, FBI-HH-B-126/87, 1987.

    Google Scholar 

  3. H. Carstensen, R. Valk: Infinite Behaviour and Fairness in Petri Nets; In G. Rozenberg (ed.): Advances in Petri Nets 1984; Lecture Notes in Computer Science 188, (pp. 83–100), Springer, Berlin 1985.

    Google Scholar 

  4. R. S. Cohen, A. Y. Gold: Theory of ω-Languages, Part I: Characterization of ω-Context-Free Languages, Part II: A Study of Various Models of ω-Type Generation and Recognition; Journal of Computer and System Sciences 15, (pp. 169–208), 1977.

    Google Scholar 

  5. R. S. Cohen, A. Y. Gold: ω-Computations on Deterministic Pushdown Machines; Journal of Computer and System Sciences 16, (pp. 275–300), 1978.

    Google Scholar 

  6. L. E. Dickson: Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors; American Journal of Mathematics 35, (pp. 413–422), 1913.

    Google Scholar 

  7. R. Hossley: Finite Tree Automata and ω-automata; Project MAC, M.I.T., Technical Report 102, 1972.

    Google Scholar 

  8. L. H. Landweber: Decision Problems for ω-Automata; Mathematical System Theory 3, (pp. 376–384), 1969.

    Google Scholar 

  9. R. McNaughton: Testing and Generating Infinite Sequences by a Finite Automaton; Information and Control 9, (pp. 521–530), 1966.

    Google Scholar 

  10. E. Pelz: Closure Properties of Deterministic Petri Nets; STACS 87, Proceedings, Lecture Notes in Computer Science 247, (pp. 371–382), Springer, Berlin 1987.

    Google Scholar 

  11. R. Valk: Infinite Behaviour of Petri Nets; Theoretical Computer Science 25, (pp. 311–341), 1983.

    Google Scholar 

  12. G. Vidal-Naquet: Deterministic Languages of Petri Nets; in Application and Theory of Petri Nets, Informatik Fachberichte 52, (pp. 198–202), Springer, Berlin 1982.

    Google Scholar 

  13. G. Vidal-Naquet: Réseaux de Petri déterministes; Thèse d'Etat, Université de Paris VI, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Informatik, Universität Hamburg, Rothenbaumchaussee 67/69, D-2000, Hamburg 13

    Heino Carstensen

Authors
  1. Heino Carstensen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michal P. Chytil Václav Koubek Ladislav Janiga

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Carstensen, H. (1988). Infinite behaviour of deterministic petri nets. In: Chytil, M.P., Koubek, V., Janiga, L. (eds) Mathematical Foundations of Computer Science 1988. MFCS 1988. Lecture Notes in Computer Science, vol 324. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017144

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50110-7

  • Online ISBN: 978-3-540-45926-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation