Skip to main content
SpringerLink
Log in

Deciding finiteness of Petri nets up to bisimulation

  • Session 12: Process Theory II
  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1996)

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

Included in the following conference series:

Abstract

We study the following problems for strong and weak bisimulation equivalence: given a labelled Petri net and a finite transition system, are they equivalent?; given a labelled Petri net, is it equivalent to some (unspecified) finite transition system? We show that both problems are decidable for strong bisimulation and undecidable for weak bisimulation.

This author acknowledges the support of DAAD; he is also partly supported by the Grant Agency of the Czech Republic, Grant No. 201/96/0195.

Supported by the Project SAM of the Sonderforschungsbereich 342.

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. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation Equivalence is Decidable for all Basic Parallel Processes. In Proceedings of CONCUR '93, LNCS 715, 143–157, 1993.

    Google Scholar 

  2. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation Equivalence is Decidable for all Context-free Processes. In Proceedings of CONCUR '92, LNCS 630, 138–147, 1992.

    Google Scholar 

  3. J. Esparza and M. Nielsen. Decidability Issues for Petri Nets — a Survey. Bulletin of the EATCS, 52:245–262, 1994, and Journal of Information Processing and Cybernetics 30(3):143–160, 1995.

    Google Scholar 

  4. Y. Hirshfeld. Petri Nets and the Equivalence Problem. In Proceedings of CSL '93, LNCS 832, 165–174, 1994.

    Google Scholar 

  5. P. Jančar. Decidability of a Temporal Logic Problem for Petri Nets. Theoretical Computer Science, 74:71–93, 1990.

    Article  Google Scholar 

  6. P. Jančar. All Action-based Behavioural Equivalences are Undecidable for Labelled Petri Nets. Bulleting of the EATCS, 56:86–88, 1995.

    Google Scholar 

  7. P. Jančar. Decidability Questions for Equivalences in Petri Nets. Technical report, University of Ostrava, habilitation thesis, 1995.

    Google Scholar 

  8. P. Jancar. Undecidability of Bisimilarity for Petri Nets and Some Related Problems. Theoretical Computer Science, 148:281–301, 1995.

    Article  Google Scholar 

  9. P. Jančar and F. Moller. Checking Regular Properties of Petri Nets. In Proceedings of CONCUR '95, LNCS 962, 348–362, 1995.

    Google Scholar 

  10. S. Mauw and H. Mulder. Regularity of BPA-systems is Decidable. In Proceedings of CONCUR '94, LNCS 836, 34–47, 1994.

    Google Scholar 

  11. R. Valk and G. Vidal-Naquet. Petri Nets and Regular Languages. Journal of Computer and system Sciences, 23(3):299–325, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, University of Ostrava, Dvořákova 7, 701 03, Ostrava, Czech Republic

    Petr Jančar

  2. Institut für Informatik, Technische Universität München, Arcisstr. 21, D-80290, München, Germany

    Javier Esparza

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Javier Esparza
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedhelm Meyer Burkhard Monien

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P., Esparza, J. (1996). Deciding finiteness of Petri nets up to bisimulation. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_152

Download citation

  • DOI: https://doi.org/10.1007/3-540-61440-0_152

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61440-1

  • Online ISBN: 978-3-540-68580-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation