Skip to main content
SpringerLink
Log in

The joys of bisimulation

  • Invited Papers
  • Conference paper
  • First Online:
Mathematical Foundations of Computer Science 1998 (MFCS 1998)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baeten, J., Bergstra, J., and Klop, J. (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association of Computing Machinery, 40, 653–682.

    MATH  MathSciNet  Google Scholar 

  2. van Benthem, J. (1984). Correspondence theory. In Handbook of Philosophical Logic, Vol. II, ed. Gabbay, D. and Guenthner, F., 167–248, Reidel.

    Google Scholar 

  3. van Benthem, J. (1996). Exploring Logical Dynamics. CSLI Publications.

    Google Scholar 

  4. Burkart, O., Caucal, D., and Steffen, B. (1996). Bisimulation collapse and the process taxonomy. Lecture Notes in Computer Science, 1119, 247–262.

    MathSciNet  Google Scholar 

  5. Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61–86.

    Article  MathSciNet  Google Scholar 

  6. Caucal, D. (1996). On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science, 1099, 194–205.

    MATH  MathSciNet  Google Scholar 

  7. Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311–337.

    MathSciNet  Google Scholar 

  8. Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143–157.

    MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  10. Dawar, A. (1997). A restricted second-order logic for finite structures, To appear in Information and Computation.

    Google Scholar 

  11. Emerson, E., and Jutla, C. (1988). The complexity of tree automata and logics of programs. Extended version from FOCS '88.

    Google Scholar 

  12. Goldblatt, R. (1995). Saturation and the Hennessy-Milner property. In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 107–130.

    Google Scholar 

  13. Groote, J., and Hüttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation, 115, 354–371.

    Article  MATH  MathSciNet  Google Scholar 

  14. Hennessy, M. and Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32, 137–162.

    MATH  MathSciNet  Google Scholar 

  15. Hollenberg, M. (1995). Hennessy-Milner classes and process calculi. In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 187–216.

    Google Scholar 

  16. Hüttel, H. (1994). Undecidable equivalences for basic parallel processes. Lecture Notes in Computer Science, 789.

    Google Scholar 

  17. Jančar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581–594.

    Google Scholar 

  18. Janin, D. and Walukiewicz, I (1996). On the expressive completeness of the prepositional mu-calculus with respect to the monadic second order logic. Lecture Notes in Computer Science, 1119, 263–277.

    MathSciNet  Google Scholar 

  19. Kozen, D. (1983). Results on the propositional mu-calculus. Theoretical Computer Science, 27, 333–354.

    Article  MATH  MathSciNet  Google Scholar 

  20. Milner, R. (1989). Communication and Concurrency. Prentice Hall.

    Google Scholar 

  21. Moller, F. (1996). Infinite results. Lecture Notes in Computer Science, 1119, 195–216.

    MathSciNet  Google Scholar 

  22. Otto, M. (1997). Bisimulation-invariant ptime and higher-dimensional μ-calculus. Preliminary report RWTH Aachen.

    Google Scholar 

  23. Park, D. (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 154, 561–572.

    Google Scholar 

  24. Rosen, E. (1995). Modal logic over finite structures. Tech Report, University of Amsterdam.

    Google Scholar 

  25. Rutten, J. (1995). A calculus of transition systems (towards universal coalgebra). In Modal Logic and Process Algebra, ed. Ponse, A., De Rijke, M. and Venema, Y. CSLI Publications, 187–216.

    Google Scholar 

  26. Sénizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Computer Science, 1256, 671–681.

    Google Scholar 

  27. Sénizergues, G. (1998). γ(A) ∼ γ(B)? Draft paper.

    Google Scholar 

  28. Stirling, C. (1996). Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043, 149–237.

    Google Scholar 

  29. Stirling, C. (1996). Games and modal mu-calculus. Lecture Notes in Computer Science, 1055, 298–312.

    Google Scholar 

  30. Thomas, W. (1993). On the Ehrenfeucht-FraÏssé game in theoretical computer science. Lecture Notes in Computer Science, 668.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, UK

    Colin Stirling

Authors
  1. Colin Stirling
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Luboš Brim Jozef Gruska Jiří Zlatuška

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Stirling, C. (1998). The joys of bisimulation. In: Brim, L., Gruska, J., Zlatuška, J. (eds) Mathematical Foundations of Computer Science 1998. MFCS 1998. Lecture Notes in Computer Science, vol 1450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0055763

Download citation

  • DOI: https://doi.org/10.1007/BFb0055763

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64827-7

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation