Skip to main content
SpringerLink
Log in

Linear time algorithms for liveness and boundedness in conflict-free Petri nets

  • Conference paper
  • First Online:
LATIN '92 (LATIN 1992)

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

Included in the following conference series:

Work supported by the ESPRIT II Basic Research Action Program of the European Community under contract No.3075 (Project ALCOM) and by the Italian Project “Algoritmi e Strutture di Calcolo”, Ministero dell'Università e della Ricerca Scientifica e Tecnologica.

On leave from ESLAI (Escuela Superior Latinoamericana de Informática), partially supported by a grant from Fundación Antorchas, Argentina.

This article was processed using the LATEX macro package with LMAMULT style

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. G. Ausiello, A. D'Atri, D. Saccá, Graph algorithms for functional dependency manipulation, J. ACM, 30 (1983), 752–766.

    Google Scholar 

  2. G. Ausiello, G.F. Italiano, On-line algorithms for polynomially solvable satisfiability problems, to appear in Journal of Logic Programming (1991).

    Google Scholar 

  3. G. Ausiello, G.F. Italiano, and U. Nanni, Dynamic Maintenance of Directed Hypergraphs Theoretical Computer Science 72, 2–3 (1990), 97–117.

    Google Scholar 

  4. C. Berge, Graphs and Hypergraphs, North Holland, Amsterdam (1973).

    Google Scholar 

  5. H. Boley, Directed recursive labelnode hypergraphs: A new representation language, Artificial Intelligence, 9 (1977), 49–85.

    Google Scholar 

  6. S. Crespi-Reghizzi, and D. Mandrioli, A Decidability Theorem for a Class of Vector Additions Systems, Information Processing Letters, 3, 3 (1975), 78–80.

    Google Scholar 

  7. G. Gallo, G. Lon go, S. Nguyen, S. Pallottino, Directed Hypergraphs and Applications Tech. Rep. TR-3/90, Univ. Pisa, Dip. di Informatica, January 1990.

    Google Scholar 

  8. R. Howell, and L. Rosier, Completeness Results for Reachability, Containement, and Equivalence, with Respect to Conflict-Free Vector Replacement Systems, Proc. of the 14th International Colloquium on Automata, Languages, and Programming, Lect. Not. in Computer Sci., 267, Springer-Verlag (1987), 509–520.

    Google Scholar 

  9. R. Howell, and L. Rosier, Recent Results on the Complexity of Problems Related to Petri Nets, Advances in Petri Nets 1987, Lect. Not. in Computer Sci. 266, Springer-Verlag (1987), 43–72.

    Google Scholar 

  10. R. Howell, and L. Rosier, On Questions of Fairness and Temporal Logic for Conflict-Free Petri Nets, Advances in Petri Nets 1988, Lect. Not. in Computer Sci. 340, Springer-Verlag (1988), 200–226.

    Google Scholar 

  11. R. Howell, L. Rosier, and H.Yen, An O(n 1.5) Algorithm to Decide Boundedness for Conflict-Free Vector Replacement System, Information Processing Letters, 25, 1 (1987), 27–33.

    Google Scholar 

  12. G.F. Italiano, Amortized efficiency of a path retrieval data structure,. Theoretical Computer Science, 48, (1986), 273–281.

    Google Scholar 

  13. M. Jantzen, Complexity of Place/Transitions Nets, Advances in Petri Nets 1986, Lect. Not. in Computer Sci. 255, Springer-Verlag (1986), 411–434.

    Google Scholar 

  14. N. D. Jones, L. H. Landweber, Y. E. Lien, Complexity of some Problem in Petri Nets, Theoret. Comp. Sci., 4, (1977), 277–299.

    Google Scholar 

  15. R.M. Karp, and R. Miller Parallel Program Schemata, J. Comput. Syst. Sci., 3, 2 (1969), 147–195.

    Google Scholar 

  16. J.A. La Poutre, J. Van Leeuwen, Maintenance of Transitive Closures and Transitive Reducitons of Graphs, Technical Report RUU-CS-87-25, University of Utrecht (1987).

    Google Scholar 

  17. L. Landweber, and E. Robertson, Properties of Conflict-Free and Persistent Petri Nets, J. ACM, 25, 3 (1978), 352–364.

    Google Scholar 

  18. J. L. Peterson, Petri Nets, Computing Surveys, 9, 3 (1977), 223–252.

    Google Scholar 

  19. C. A. Petri, Communication with automata, Supplement 1 to Tech.Report RADC-TR-65-377, Vol. 1 Griffiss AFB, New York (1966), original in German; Kommunikation mit Automaten, Univ. of Bonn (1962).

    Google Scholar 

  20. W.Reisig, Petri Nets, an introduction, ETACS Monographs Theoret. Comp. Sci., Springer-Verlag (1985).

    Google Scholar 

  21. R.E. Tarjan, Amortized computational complexity, SIAM J. Alg. Disc. Meth., 6 (1985), 306–318.

    Google Scholar 

Download references

Author information

Author notes

  1. Umberto Nanni

    Present address: The International Computer Science Institute, Berkeley, California

Authors and Affiliations

  1. Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, via Salaria 113, I-00198, Roma, Italia

    Paola Alimonti, Esteban Feuerstein & Umberto Nanni

  2. Dipartimento di Matematica Pura ed Applicata, Università di L'Aquila, via Vetoio, I-67010, Coppito, L'Aquila, Italia

    Umberto Nanni

Authors
  1. Paola Alimonti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Esteban Feuerstein
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Umberto Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Imre Simon

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Alimonti, P., Feuerstein, E., Nanni, U. (1992). Linear time algorithms for liveness and boundedness in conflict-free Petri nets. In: Simon, I. (eds) LATIN '92. LATIN 1992. Lecture Notes in Computer Science, vol 583. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023812

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55284-0

  • Online ISBN: 978-3-540-47012-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation