Skip to main content
SpringerLink
Log in

Liveness in bounded Petri nets which are covered by T-invariants

  • Full Papers
  • Conference paper
  • First Online:
Application and Theory of Petri Nets 1994 (ICATPN 1994)

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

Included in the following conference series:

Abstract

In this paper a criterion is introduced that is sufficient for the liveness in Petri nets which are bounded and covered by non-negative T-invariants.

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. Bernd Baumgarten. Petri-Netze: Grundlagen und Anwendungen. BI-Wiss.-Verl., Mannheim; Wien; Zürich, 1990. (in German).

    Google Scholar 

  2. J. Campos, G. Chiola, and M. Silva. Properties and performance bounds for closed free choice synchronized monoclass queueing networks. IEEE Transactions on Automatic Control, 36(12), December 1991.

    Google Scholar 

  3. Jörg Desel. Regular marked petri nets. To appear in: Graph theoretic Concepts in Computer Science, 1993.

    Google Scholar 

  4. Javier Esparza and Manuel Silva. A polynomial-time algorithm to decide liveness of bounded free choice nets. Theoretical Computer Science, (102):185–205, 1992.

    Google Scholar 

  5. M. Hack. Extended state-machine allocatable nets (esma), an extension of free choice petri net results. Computation Structures Group Memo 78-1, MIT, Project MAC, 1978.

    Google Scholar 

  6. M. Jantzen and R. Valk. Formal properties of place/transition nets. Net Theory and Application, LNCS 84:165–212, 1980.

    Google Scholar 

  7. W.E. Kluge and K. Lautenbach. The orderly resolution of memory access conflicts among competing channel processes. IEEE Transactions of Computers, C-31(3):194–207, 1982.

    Google Scholar 

  8. K. Lautenbach. Exakte bedingungen der lebendigkeit für eine klasse von petrinetzen. Berichte der GMD 82, GMD, Bonn, 1973. (in German).

    Google Scholar 

  9. K. Lautenbach. Ein kombinatorischer ansatz zur beschreibung und erreichung von fairness in scheduling-problemen. Applied Computer Science, 8:228–250, 1977. (in German).

    Google Scholar 

  10. Kurt Lautenbach. Linear algebraic calculation of deadlocks and traps. In Voss, Genrich, and Rozenberg, editors, Concurrency and Nets, pages 315–336. Springer Verlag, 1987.

    Google Scholar 

  11. Wolfgang Reisig. Petri nets. Springer Verlag, 2nd edition, 1991.

    Google Scholar 

  12. H. Peter Starke. Analyse von Petri-Netz-Modellen. Teubner, 1990. (in German).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Software Technology, University Koblenz-Landau, Rheinau 1, 56075, Koblenz, Germany

    Kurt Lautenbach & Hanno Ridder

Authors
  1. Kurt Lautenbach
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanno Ridder
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Robert Valette

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lautenbach, K., Ridder, H. (1994). Liveness in bounded Petri nets which are covered by T-invariants. In: Valette, R. (eds) Application and Theory of Petri Nets 1994. ICATPN 1994. Lecture Notes in Computer Science, vol 815. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58152-9_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-58152-9_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58152-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation