Skip to main content
SpringerLink
Log in

Petri nets and the equivalence problem

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1993)

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

Included in the following conference series:

Abstract

We prove that trace equivalence is undecidable for the very small and natural subclass of Petri nets in which no transition requires more than one token; this subclass corresponds exactly to the calculus BPP of Christensen for which bisimulation equivalence is known to be decidable. We present this result along with a survey of decidability results for various notions of equivalence with respect to various subclasses of Petri nets.

Currently on sabbatical leave from Tel Aviv University.

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. J.C.M. Baeten, J.A. Bergstra and J.W. Klop. Decidability of bisimulation equiv-alence for processes generating context free languages. In Proceedings of PARLE 87, LNCS 259, pp93–114, Springer Verlag 1987.

    Google Scholar 

  2. S. Christensen. Decidability and Decomposition in Process Algebra. Ph.D Thesis, Edinburgh University, 1993.

    Google Scholar 

  3. S. Christensen, Y. Hirshfeld, F. Moller. Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. In Proceedings of LICS93, IEEE Computer Society Press.

    Google Scholar 

  4. S. Christensen, Y. Hirshfeld, F. Moller. Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR93, 1993.

    Google Scholar 

  5. J. Esparza. A note on BPP processes. Unpublished manuscript, University of Edinburgh, 1993.

    Google Scholar 

  6. R. van Glabbeek. The linear time — branching time spectrum. In Proceedings of CONCUR90. LNCS 458, pp278–297, 1990.

    Google Scholar 

  7. J.F. Groote, H. Hüttel. Undecidable equivalences for basic process algebra. Information and Computation, 1993.

    Google Scholar 

  8. M. Hack. Decision problems for Petri nets and vector addition systems. MAC Technical Memo 53, MIT, 1975.

    Google Scholar 

  9. M. Hack. The equality problem for vector addition systems is undecidable. TCS 2, pp77–95, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  10. M. Hennessy, R. Milner. Algebraic laws for nondeterminism and concurrency. JACM, Vol 32, No 1, 1985.

    Google Scholar 

  11. H. Hüttel. Undecidable equivalences for basic parallel processes. University of Edinburgh, 1993.

    Google Scholar 

  12. P. Jančar. Decidability questions for bisimilarity of Petri nets and some related problems. Proceedings of STACS94, Caen. LNCS 775, Springer Verlag pp581–592, 1994.

    Google Scholar 

  13. S.R. Kosaraju. Decidability of reachability in vector addition systems. In Proceedings of the 6th Annual Symposium on the Theory of Computing, pp267–281, 1982.

    Google Scholar 

  14. E.W. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13, pp441–460, 1984.

    Article  MATH  MathSciNet  Google Scholar 

  15. R. Milner. Communication and Concurrence. Prentice Hall 1989.

    Google Scholar 

  16. M. Minsky. Computation: Finite and Infinite Machines. Prentice Hall, 1967.

    Google Scholar 

  17. W. Reisig. Petri Nets. Springer Verlag, 1982.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tel Aviv University, Israel

    Yoram Hirshfeld

  2. LFCS, University of Edinburgh, UK

    Yoram Hirshfeld

Authors
  1. Yoram Hirshfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Egon Börger Yuri Gurevich Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hirshfeld, Y. (1994). Petri nets and the equivalence problem. In: Börger, E., Gurevich, Y., Meinke, K. (eds) Computer Science Logic. CSL 1993. Lecture Notes in Computer Science, vol 832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049331

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48599-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation