Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 1999: CONCUR’99 Concurrency Theory pp 30–45Cite as

Techniques for Decidability and Undecidability of Bisimilarity

  • Conference paper
  • First Online:

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

Abstract

In this tutorial we describe general approaches to deciding bisimilarity between vertices of (infinite) directed edge-labelled graphs. The approaches are based on a systematic search following the definition of bisimilarity. We outline (in decreasing levels of detail) how the search is modified to solve the problem for finite graphs, BPP graphs, BPA graphs, normed PA graphs, and normed PDA graphs. We complete this by showing the technique used in the case of graphs generated by onecounter machines. Finally, we demonstrate a general reduction strategy for proving undecidability, which we apply in the case of graphs generated by state-extended BPP (a restricted form of labelled Petri nets).

The second author is supported by Swedish TFR grants No. 221-98-103 ’Verification of Infinite State Automata’ and 221-97-275 ’Games for Processes’.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about 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 (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40:653–682. (Preliminary version in the proceedings of PARLE’87, Lecture Notes in Computer Science 259:94-113, 1987).

    Google Scholar 

  2. O. Burkart, D. Caucal and B. Steffen (1995). An elementary decision procedure for arbitrary context-free processes. Proceedings of MFCS’95. Lecture Notes in Computer Science 969:423–433.

    Google Scholar 

  3. S. Christensen, Y. Hirshfeld and F. Moller (1993). Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR’93, Lecture Notes in Computer Science 715:143–157.

    Google Scholar 

  4. S. Christensen, H. Hüttel and C. Stirling (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121(2):143–148. (Preliminary version in the proceedings of CONCUR’92, Lecture Notes in Computer Science 630:138-147, 1992).

    Google Scholar 

  5. S. Eilenberg and M. P. Schützenberger (1969). Rational sets in commutative monoids. Journal of Algebra 13:173–191.

    Article  MATH  MathSciNet  Google Scholar 

  6. L. E. Dickson (1913). Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics 35:413–422.

    Article  MathSciNet  Google Scholar 

  7. Y. Hirshfeld (1994). Congruences in commutative semigroups. Research Report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh.

    Google Scholar 

  8. Y. Hirshfeld (1997). Bisimulation trees and the decidability of weak bisimulations. Electronic Notes in Theoretical Computer Science 5, http://www.elsevier.nl/locate/entcs/volume5.html.

  9. Y. Hirshfeld and M. Jerrum (1999). Bisimulation equivalence is decidable for normed Process Algebra. Proceedings of ICALP’99, to appear, Lecture Notes in Computer Science 1644.

    Google Scholar 

  10. Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158:143–159. (Preliminary version in the proceedings of FOCS’94:623-631, 1994).

    Article  MATH  MathSciNet  Google Scholar 

  11. Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. Mathematical Structures in Computer Science 6:251–259.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Jančar (1995). Undecidability of bisimilarity for Petri nets and related problems. Theoretical Computer Science 148:281–301. (Preliminary version in the proceedings of STACS’94, Lecture Notes in Computer Science 775:581-592, 1994).

    Google Scholar 

  13. P. Jančar (1997). Bisimulation equivalence is decidable for one-counter processes. Proceedings of ICALP’97, Lecture Notes in Computer Science 1256:549–559. (To appear in Information and Computation).

    Google Scholar 

  14. P. Jančar, A. Kučera and R. Mayr (1998). Deciding bisimulation-like equivalences with finite-state processes. Proceedings of ICALP’98, Lecture Notes in Computer Science 1443:200–211. (To appear in Theoretical Computer Science).

    Google Scholar 

  15. P. Jančar, J. Esparza and F. Moller (1999). Petri nets and regular processes. Journal of Computer and System Sciences (to appear). (Research Report 162, Computing Science Department, Uppsala University.

    Google Scholar 

  16. P. Jančar and F. Moller (1999). Simulation of one-counter nets via colouring. Research Report 159, Computing Science Department, Uppsala University.

    Google Scholar 

  17. P. C. Kanellakis and S. A. Smolka. CCS expressions, finite-state processes and three problems of equivalence. Information and Computation 86:43–68, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  18. E. Mayr (1984). An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13:441–460.

    Article  MATH  MathSciNet  Google Scholar 

  19. E. W. Mayr and A. R. Meyer (1982). The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics 46:305329.

    Article  MathSciNet  Google Scholar 

  20. R. Milner and F. Moller (1993). Unique decomposition of processes. Theoretical Computer Science 107:357–363. (Preliminary version in the Bulletin of the EATCS 41:226-232, 1990.)

    Article  MATH  MathSciNet  Google Scholar 

  21. M. Minsky (1967). Computation: Finite and Infinite Machines. PrenticeHall.

    Google Scholar 

  22. F. Moller (1996). Infinite results. Proceedings of CONCUR’96, Lecture Notes in Computer Science 1119:195–216.

    Google Scholar 

  23. D. C. Oppen (1978). A 222p(n) upper bound on the complexity of Presburger arithmetic. Journal of Computer and System Science 16:323–332.

    Google Scholar 

  24. R. Paige and R. E. Tarjan. Three partition refinement algorithms. SIAM Journal on Computing 16:937–989, 1987.

    Article  MathSciNet  Google Scholar 

  25. L. Redei (1965). The theory of finitely generated commutative semigroups. Oxford University Press.

    Google Scholar 

  26. G. Sénizergues (1997). The Equivalence Problem for Deterministic Pushdown Automata is Decidable. Proceedings of ICALP’97, Lecture Notes in Computer Science 1256:671–681.

    Google Scholar 

  27. C. Stirling (1998). Decidability of bisimulation equivalence for normed pushdown processes. Theoretical Computer Science 195:113–131. (Preliminary version in the proceedings of CONCUR’96, Lecture Notes in Computer Science 1119:217-232, 1996).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technical University of Ostrava, Czech Republic

    Petr Jančar

  2. Uppsala University, Sweden

    Faron Moller

Authors
  1. Petr Jančar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Faron Moller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Jos C. M. Baeten  & Sjouke Mauw  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jančar, P., Moller, F. (1999). Techniques for Decidability and Undecidability of Bisimilarity. In: Baeten, J.C.M., Mauw, S. (eds) CONCUR’99 Concurrency Theory. CONCUR 1999. Lecture Notes in Computer Science, vol 1664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48320-9_5

Download citation

  • DOI: https://doi.org/10.1007/3-540-48320-9_5

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66425-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation