Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP

  • Conference paper
CONCUR 2005 – Concurrency Theory (CONCUR 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3653))

Included in the following conference series:

Abstract

We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and complete equational axiomatization for the equivalence. Both results are derived from a decomposition property of hhp-b, which is the main technical contribution of the paper. Altogether, our results complement previous work on complexity and decomposition of classical and history-preserving bisimilarity on BPP.

This work is supported by the European Community Research Training Network Games.

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. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Co, Reading (1974)

    MATH  Google Scholar 

  2. Bednarczyk, M.: Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Polish Academy of Sciences, Gdansk (1991)

    Google Scholar 

  3. Christensen, S.: Decidability and Decomposition in process algebras. PhD thesis, Dept. of Computer Science, University of Edinburgh, UK (1993)

    Google Scholar 

  4. Esparza, J., Kiehn, A.: On the model checking problem for branching time logics and basic parallel processes. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 353–366. Springer, Heidelberg (1995)

    Google Scholar 

  5. Fröschle, S.: Decidability of plain and hereditary history-preserving bisimulation for BPP. In: Proc. EXPRESS 1999. ENTCS, vol. 27 (1999)

    Google Scholar 

  6. Fröschle, S.: Composition and decomposition in true-concurrency. In: Sassone, V. (ed.) FOSSACS 2005. LNCS, vol. 3441, pp. 333–347. Springer, Heidelberg (2005) (to appear)

    Google Scholar 

  7. Fröschle, S.: The decidability border of hereditary history preserving bisimilarity. Information Processing Letters (2005) (to appear)

    Google Scholar 

  8. Fröschle, S., Hildebrandt, T.: On plain and hereditary history-preserving bisimulation. In: Kutyłowski, M., Wierzbicki, T., Pacholski, L. (eds.) MFCS 1999. LNCS, vol. 1672, pp. 354–365. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  9. Fröschle, S., Lasota, S.: Decomposition and complexity of hereditary history preserving bisimulation on BPP. Technical Report 280, Institute of Informatics, Warsaw University, Poland (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Jančar, P.: Bisimilarity of basic parallel processes is PSPACE-complete. In: Proc. LICS 2003, pp. 218–227 (2003)

    Google Scholar 

  12. Jančar, P., Sawa, Z.: On distributed bisimilarity over Basic Parallel Processes. In: Proc. AVIS2 2005 (2005)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Joyal, A., Nielsen, M., Winskel, G.: Bisimulation from open maps. Information and Computation 127, 164–185 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  15. Jurdziński, M., Nielsen, M., Srba, J.: Undecidability of domino games and hhpbisimilarity. Inform. and Comput. 184, 343–368 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lasota, S.: A polynomial-time algorithm for deciding true concurrency equivalences of Basic Parallel Processes. In: Rovan, B., Vojtáš, P. (eds.) MFCS 2003. LNCS, vol. 2747, pp. 521–530. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Milner, R., Moller, F.: Unique decomposition of processes. TCS 107(2), 357–363 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  18. Srba, J.: Strong bisimilarity and regularity of Basic Parallel Processes is PSPACE-hard. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol. 2285, p. 535. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  19. Srba, J.: Roadmap of Infinite Results. Formal Models and Semantics, vol. 2. World Scientific Publishing Co., Singapore (2004)

    Google Scholar 

  20. Sunesen, K., Nielsen, M.: Behavioural equivalence for infinite systems—partially decidable! In: Billington, J., Reisig, W. (eds.) ICATPN 1996. LNCS, vol. 1091, pp. 460–479. Springer, Heidelberg (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, 02–097 Warszawa, Banacha 2, Poland

    Sibylle Fröschle & Sławomir Lasota

Authors
  1. Sibylle Fröschle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sławomir Lasota
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of California, Santa Cruz

    Martín Abadi

  2. University of California, Santa Cruz, USA

    Luca de Alfaro

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fröschle, S., Lasota, S. (2005). Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_22

Download citation

  • DOI: https://doi.org/10.1007/11539452_22

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation