Skip to main content
SpringerLink
Log in

Undecidability of Weak Bisimilarity for PA-Processes

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2002)

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

Included in the following conference series:

Abstract

We prove that the problem whether two PA-processes are weakly bisimilar is undecidable. We combine several proof techniques to provide a reduction from Post’s correspondence problem to our problem: existential quantification technique, masking technique and deadlock elimination technique.

The author is supported in part by the GACR, grant No. 201/00/0400.

Basic Research in Computer Science, Centre of the Danish National Research Foundation.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C.M. Baeten and W.P. Weijland. Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1990.

    Google Scholar 

  2. O. Burkart, D. Caucal, F. Moller, and B. Steffen. Verification on infinite structures. In J. Bergstra, A. Ponse, and S. Smolka, editors, Handbook of Process Algebra, chapter 9, pages 545–623. Elsevier Science, 2001.

    Google Scholar 

  3. Y. Hirshfeld and M. Jerrum. Bisimulation equivalence is decidable for normed process algebra. In Proc. of Automata, Languages and Programming, 26th International Colloquium (ICALP’99), volume 1644 of LNCS, pages 412–421. Springer-Verlag, 1999.

    Google Scholar 

  4. P. Jančar. High undecidability of weak bisimilarity for Petri nets. In Proc. of Colloquium on Trees in Algebra and Programming (CAAP’95), volume 915 of LNCS, pages 349–363. Springer-Verlag, 1995.

    Google Scholar 

  5. P. Jančar. Undecidability of bisimilarity for Petri nets and some related problems. Theoretical Computer Science, 148(2):281–301, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  6. P. Jančar and J. Esparza. Deciding finiteness of Petri nets up to bisimulation. In Proc. of 23rd International Colloquium on Automata, Languages, and Programming (ICALP’96), volume 1099 of LNCS, pages 478–489. Springer-Verlag, 1996.

    Google Scholar 

  7. P. Jančar and F. Moller. Checking regular properties of Petri nets. In Proc. of 6th International Conference on Concurrency Theory (CONCUR’95), volume 962 of LNCS, pages 348–362. Springer-Verlag, 1995.

    Google Scholar 

  8. R. Mayr. On the complexity of bisimulation problems for basic parallel processes. In Proc. of 27st International Colloquium on Automata, Languages and Programming (ICALP’00), volume 1853 of LNCS, pages 329–341. Springer-Verlag, 2000.

    Google Scholar 

  9. R. Mayr. Process rewrite systems. Information and Comp., 156(1):264–286, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  10. E.L. Post. A variant of a recursively unsolvable problem. Bulletion of the American Mathematical Society, 52:264–268, 1946.

    Article  MATH  MathSciNet  Google Scholar 

  11. G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. In Proc. of the 39th Annual Symposium on Foundations of Computer Science(FOCS’98), pages 120–129. IEEE Computer Society, 1998.

    Google Scholar 

  12. J. Srba. Basic process algebra with deadlocking states. Theoretical Computer Science, 266(1–2):605–630, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACEhard. In Proc. of 19th International Symposium on Theoretical Aspects of Computer Science (STACS’02), volume 2285 of LNCS, pages 535–546. Springer-Verlag, 2002.

    Google Scholar 

  14. J. Srba. Undecidability of weak bisimilarity for pushdown processes. In Proc. of 13th International Conference on Concurrency Theory (CONCUR’02), volume 2421 of LNCS, pages 579–593. Springer-Verlag, 2002.

    Google Scholar 

  15. C. Stirling. Local model checking games. In Proc. of 6th International Conference on Concurrency Theory (CONCUR’95), volume 962 of LNCS, pages 1–11. Springer-Verlag, 1995.

    Google Scholar 

  16. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract). In Proc. of 4th International Joint Conference CAAP/FASE, Theory and Practice of Software Development (TAPSOFT’93), volume 668 of LNCS, pages 559–568. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. BRICS Department of Computer Science, University of Aarhus, Ny Munkegade bld. 540, 8000, Aarhus C, Denmark

    Jiří Srba

Authors
  1. Jiří Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Science and Faculty of Engineering, Kyoto Sangyo University, 603-8555, Kyoto, Japan

    Masami Ito  & Masafumi Toyama  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srba, J. (2003). Undecidability of Weak Bisimilarity for PA-Processes. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-45005-X_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40431-6

  • Online ISBN: 978-3-540-45005-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation