Skip to main content
SpringerLink
Log in

Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard

  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 2002)

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

Included in the following conference series:

Abstract

Strong bisimilarity and regularity checking problems of Basic Process Algebra (BPA) are decidable, with the complexity upper bounds 2-EXPTIME. On the other hand, no lower bounds were known. In this paper we demonstrate PSPACE-hardness of these problems.

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 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

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. J.A. Bergstra and J.W. Klop. Algebra of communicating processes with abstraction. Theoretical Computer Science, 37:77–121, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  3. 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 

  4. O. Burkart, D. Caucal, and B. Steffen. An elementary decision procedure for arbitrary context-free processes. In Proceedings of MFCS’95, volume 969 of LNCS, pages 423–433. Springer-Verlag, 1995.

    Google Scholar 

  5. O. Burkart, D. Caucal, and B. Steffen. Bisimulation collapse and the process taxonomy. In Proceedings of CONCUR’96, volume 1119 of LNCS, pages 247–262. Springer-Verlag, 1996.

    Google Scholar 

  6. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation is decidable for basic parallel processes. In Proceedings of CONCUR’93, volume 715 of LNCS, pages 143–157. Springer-Verlag, 1993.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  8. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science, 158(1–2):143–159, 1996.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  10. A. Kucera. Regularity is decidable for normed BPA and normed BPP processes in polynomial time. In Proceedings 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 Proceedings of ICALP’00, volume 1853 of LNCS, pages 329–341. Springer-Verlag, 2000.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  15. J. Srba. Strong bisimilarity and regularity of basic parallel processes is PSPACE-hard. In Proceedings of STACS’02, volume 2285 of LNCS, pages 535–546. Springer-Verlag, 2002.

    Google Scholar 

  16. J. Srba. Strong bisimilarity of simple process algebras: Complexity lower bounds. Technical Report RS-02-16, BRICS Research Series, 2002.

    Google Scholar 

  17. C. Stirling. Local model checking games. In Proceedings 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 Proceedings of the MFCS’98 Workshop on Concurrency, volume 18 of ENTCS. Springer-Verlag, 1998.

    Google Scholar 

  19. W. Thomas. On the Ehrenfeucht-Fraïssé game in theoretical computer science (extended abstract). In Proceedings of TAPSOFT’93, volume 668 of LNCS, pages 559–568. Springer-Verlag, 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Jirí Srba

Authors
  1. Jirí Srba
    View author publications

    You can also search for this author in PubMed Google Scholar

Consortia

BRICS

Editor information

Editors and Affiliations

  1. Institute of Theoretical Computer Science, ETH Zentrum, ETH Zürich, 8092, Zürich, Switzerland

    Peter Widmayer  & Stephan Eidenbenz  & 

  2. Department of Languages and Sciences of the Computation E.T.S. de Ingeniería Informática, University of Málaga, Campus de Teatinos, 29071, Málaga, Spain

    Francisco Triguero , Rafael Morales  & Ricardo Conejo ,  & 

  3. School of Cognitive and Computing Sciences, University of Sussex, Falmer, Brighton, BN1 9QN, UK

    Matthew Hennessy

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Srba, J., BRICS. (2002). Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds) Automata, Languages and Programming. ICALP 2002. Lecture Notes in Computer Science, vol 2380. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45465-9_61

Download citation

  • DOI: https://doi.org/10.1007/3-540-45465-9_61

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-45465-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation