Skip to main content
SpringerLink
Log in

On Plain and Hereditary History-Preserving Bisimulation

  • Conference paper
Mathematical Foundations of Computer Science 1999 (MFCS 1999)

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

Abstract

We investigate the difference between two well-known notions of independence bisimilarity, history-preserving bisimulation and hereditary history-preserving bisimulation. We characterise the difference between the two bisimulations in trace-theoretical terms, advocating the view that the first is (just) a bisimulation for causality, while the second is a bisimulation for concurrency. We explore the frontier zone between the two notions by defining a hierarchy of bounded backtracking bisimulations. Our goal is to provide a stepping stone for the solution to the intriguing open problem of whether hereditary history-preserving bisimulation is decidable or not. We prove that each of the bounded bisimulations is decidable. However, we also prove that the hierarchy is strict. This rules out the possibility that decidability of the general problem follows directly from the special case. Finally, we give a non trivial reduction solving the general problem for a restricted class of systems and give pointers towards a full answer.

Laboratory for Foundations of Computer Science.

Basic Research in Computer Science, Centre of the Danish National Research Foundation. Part of this work was done while the second author was at LFCS.

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. M. Bednarczyk. Hereditary history preserving bisimulation or what is the power of the future perfect in program logics. Technical report, Polish Acad. of Sciences, Gdansk, 1991.

    Google Scholar 

  2. E. Best, R. Devillers, A. Kiehn, and L. Pomello. Concurrent bisimulations in Petri nets. Acta Inform., 28(3):231–264, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  3. A. Cheng. Reasoning About Concurrent Computational Systems. PhD thesis, BRICS, Dep. of Computer Science, University of Aarhus, 1996.

    Google Scholar 

  4. A. Cheng and M. Nielsen. Open maps (at) work. Research Series RS-95-23, BRICS, Dep. of Computer Science, University of Aarhus, Apr. 1995.

    Google Scholar 

  5. P. Degano, R. De Nicola, and U. Montanari. Partial orderings descriptions and observations of nondeterministic concurrent processes. In Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, volume 354 of LNCS, pages 438–466, 1989.

    Chapter  Google Scholar 

  6. S. Fröschle. On the decidability problem of strong history-preserving bisimulation. Progress Report, 1998.

    Google Scholar 

  7. S. Fröschle and T. T. Hildebrandt. On plain and hereditary history-preserving bisimulation. Technical Report RS-99-4, BRICS, Dep. of Computer Science, University of Aarhus, 1999.

    Google Scholar 

  8. L. Jategaonkar and A. R. Meyer. Deciding true concurrency equivalences on safe, finite nets. Theor. Comp. Sci., 154(1):107–143, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Joyal, M. Nielsen, and G. Winskel. Bisimulation from open maps. Inform. and Comput., 127(2):164–185, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. U. Montanari and M. Pistore. Minimal transition systems for history-preserving bisimulation. In STACS’ 97, volume 1200 of LNCS, pages 413–425. Springer, 1997.

    Chapter  Google Scholar 

  11. M. Mukund and P. S. Thiagarajan. Linear time temporal logics over Mazurkiewicz traces. In POMIV’ 96, volume 29 of DIMACS, pages 171–201. AMS, 1997.

    Google Scholar 

  12. M. Nielsen and C. Clausen. Bisimulations, games and logic. Technical Report RS-94-6, BRICS, Dep. of Computer Science, University of Aarhus, April 1994.

    Google Scholar 

  13. A. Rabinovich and B. A. Trakhtenbrot. Behavior structures and nets. Fund. Inform., 11(4):357–403, 1988.

    MATH  MathSciNet  Google Scholar 

  14. R. van Glabbeek and U. Goltz. Equivalence notions for concurrent systems and refinement of actions. In MFCS’ 89, volume 379 of LNCS, pages 237–248. Springer, 1989.

    Google Scholar 

  15. R. van Glabbeek and U. Goltz. Refinement of actions and equivalence notions for concurrent systems, 1998. http://theory.stanford.edu/rvg/abstracts.html.

  16. W. Vogler. Deciding history preserving bisimilarity. In Automata, languages and programming’ 91, volume 510 of LNCS, pages 495–505. Springer, 1991.

    Google Scholar 

  17. W. Vogler. Bisimulation and action refinement. Theor. Comp. Sci., 114(1):173–200, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  18. W. Vogler. Generalized OM-bisimulation. Inform. and Comput., 118(1):38–47, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  19. G. Winskel and M. Nielsen. Models for concurrency. In Handbook of logic in computer science, Vol. 4, Oxford Sci. Publ., pages 1–148. Oxford Univ. Press, New York, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LFCS, University of Edinburgh, Scotland

    Sibylle B. Fröschle

  2. BRICS, University of Aarhus, Denmark

    Thomas T. Hildebrandt

Authors
  1. Sibylle B. Fröschle
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas T. Hildebrandt
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wrocław, Przesmyckiego 20, PL-51-151, Wrocław, Poland

    Mirosław Kutyłowski , Leszek Pacholski  & Tomasz Wierzbicki ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Fröschle, S.B., Hildebrandt, T.T. (1999). On Plain and Hereditary History-Preserving Bisimulation. In: Kutyłowski, M., Pacholski, L., Wierzbicki, T. (eds) Mathematical Foundations of Computer Science 1999. MFCS 1999. Lecture Notes in Computer Science, vol 1672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48340-3_32

Download citation

  • DOI: https://doi.org/10.1007/3-540-48340-3_32

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48340-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation