The joys of bisimulation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 142-151

  Stirling, Colin ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84896746128     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055763     Document Type: Conference Paper

References (30)

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.
2. van Benthem, J. (1984). Correspondence theory. In Handbook of Philosophical Logic, vol. II, ed. Gabbay, D. and Guenthner, F., 167-248, Reidel.
3. van Benthem, J. (1996). Exploring Logical Dynamics. CSLI Publications.
4. Burkart, O., Caucal, D., and Steffen, B. (1996). Bisimulation collapse and the process taxonomy. Lecture Notes in Computer Science, 1119, 247-262.
5. Caucal, D. (1992). On the regular structure of prefix rewriting. Theoretical Computer Science, 106, 61-86.
6. Caucal, D. (1996). On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science, 1099, 194-205.
7. Caucal, D., and Monfort, R. (1990). On the transition graphs of automata and grammars. Lecture Notes in Computer Science, 484, 311-337.
8. Christensen, S., Hirshfeld, Y., and Moller, F. (1993). Bisimulation is decidable for basic parallel processes. Lecture Notes in Computer Science, 715, 143-157.
9. Christensen, S., Hiittel, H., and Stirling, C. (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation, 121, 143-148.
10. Dawar, A. (1997). A restricted second-order logic for finite structures, To appear in Information and Computation.
11. Emerson, E., and Jutla, C. (1988). The complexity of tree automata and logics of programs. Extended version from FOCS '88.
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.
13. Groote, J., and Hüttel, H. (1994). Undecidable equivalences for basic process algebra. Information and Computation, 115, 354-371.
14. Hennessy, M. and Milner, R. (1985). Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32, 137-162.
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.
16. Hüttel, H. (1994). Undecidable equivalences for basic parallel processes. Lecture Notes in Computer Science, 789.
17. Jancar, P. (1994). Decidability questions for bisimilarity of Petri nets and some related problems. Lecture Notes in Computer Science, 775, 581-594.
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.
19. Kozen, D. (1983). Results on the prepositional mu-calculus. Theoretical Computer Science, 27, 333-354.
20. Milner, R. (1989). Communication and Concurrency. Prentice Hall.
21. Moller, F. (1996). Infinite results. Lecture Notes in Computer Science, 1119, 195-216.
22. Otto, M. (1997). Bisimulation-invariant ptime and higher-dimensional /i-calculus. Preliminary report RWTH Aachen.
23. Park, D. (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science, 154, 561-572.
24. Rosen, E. (1995). Modal logic over finite structures. Tech Report, University of Amsterdam.
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.
26. Sénizergues, G. (1997). The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Computer Science, 1256, 671-681.
27. Sénizergues, G. (1998). Γ(A) ~ Γ(B)? Draft paper.
28. Stirling, C. (1996). Modal and temporal logics for processes. Lecture Notes in Computer Science, 1043, 149-237.
29. Stirling, C. (1996). Games and modal mu-calculus. Lecture Notes in Computer Science, 1055, 298-312.
30. Thomas, W. (1993). On the Ehrenfeucht-Fraïssé game in theoretical computer science. Lecture Notes in Computer Science, 668.