Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 2002: STACS 2002 pp 535–546Cite as

Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard

  • Conference paper
  • First Online:

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

Abstract

We show that the problem of checking whether two processes definable in the syntax of Basic Parallel Processes (BPP) are strongly bisimilar is PSPACE-hard.

We also demonstrate that there is a polynomial time reduction from the strong bisimilarity checking problem of regular BPP to the strong regularity (finiteness) checking of BPP. This implies that strong regularity of BPP is also PSPACE-hard.

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.

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. Balcazar, J. Gabarro, and M. Santha. Deciding bisimilarity is P-complete. Formal Aspects of Computing, 4(6A):638–648, 1992.

    Article  MATH  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. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for basic parallel processes. In Proc. of CONCUR’93, volume 715 of LNCS, pages 143–157. Springer-Verlag, 1993.

    Google Scholar 

  4. S. Christensen, H. Hüttel, and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Comp., 121:143–148, 1995.

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. P. Jancar. High undecidability of weak bisimilarity for Petri nets. In Proc. of CAAP’95, volume 915 of LNCS, pages 349–363. Springer-Verlag, 1995.

    Google Scholar 

  8. P. Jancar and J. Esparza. Deciding finiteness of Petri nets up to bisimilarity. In Proc. of ICALP’96, volume 1099 of LNCS, pages 478–489. Springer-Verlag, 1996.

    Google Scholar 

  9. L. Jategaonkar and A.R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theoretical Computer Science, 154(1):107–143, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Kucera. Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In Proc. of SOFSEM’96, volume 1175 of LNCS, pages 377–384. Springer-Verlag, 1996.

    Google Scholar 

  11. R. Mayr. On the complexity of bisimulation problems for basic parallel processes. In Proc. ICALP’00, volume 1853 of LNCS, pages 329–341. Springer-Verlag, 2000.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  13. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.

    Google Scholar 

  14. Ch.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.

    Google Scholar 

  15. D.M.R. Park. Concurrency and automata on infinite sequences. In Proc. of 5th GI Conference, volume 104 of LNCS, pages 167–183. Springer-Verlag, 1981.

    Google Scholar 

  16. J. Srba. Complexity of weak bisimilarity and regularity for BPA and BPP. In Proc. of EXPRESS’00, volume 39 of ENTCS. Elsevier Science, 2000. To appear.

    Google Scholar 

  17. C. Stirling. Local model checking games. In Proc. of CONCUR’95, volume 962 of LNCS, pages 1–11. Springer-Verlag, 1995.

    Google Scholar 

  18. J. Stribrna. Hardness results for weak bisimilarity of simple process algebras. In Proc. of the MFCS’98 Workshop on Concurrency, volume 18of ENTCS. Springer-Verlag, 1998.

    Google Scholar 

  19. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract). In Proc. of the 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 

  20. R.J. van Glabbeek. Comparative Concurrency Semantics and Refinement of Actions. PhD thesis, CWI/Vrije Universiteit, 1990.

    Google Scholar 

  21. R.J. van Glabbeek. The linear time—branching time spectrum. In Proc. of CONCUR’90, volume 458 of LNCS, pages 278–297. Springer-Verlag, 1990.

    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. Institute for Computer Science, Free University of Berlin, Takustraße 9, 14195, Berlin, Germany

    Helmut Alt

  2. CNRS - I3S - INRIA Sophia Antipolis, 2004 Route des Lucioles, 06902, Sophia Antipolis, France

    Afonso Ferreira

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srba, J. (2002). Strong Bisimilarity and Regularity of Basic Parallel Processes Is PSPACE-Hard. In: Alt, H., Ferreira, A. (eds) STACS 2002. STACS 2002. Lecture Notes in Computer Science, vol 2285. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45841-7_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-45841-7_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43283-8

  • Online ISBN: 978-3-540-45841-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation