Abstract
We contrast bisimulation equivalence and language equivalence. There are two threads. First is that because bisimulation is more intensional, results in language and automata theory can be recast for bisimulation. The second thread is the contrast between definability of language equivalence and bisimulation equivalence. Bisimulation equivalence is definable as a “simple” formula in first-order logic with fixed points. We show that language equivalence is not definable as an unconditional projection of simple least fixed point.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
J. Baeten, J. Bergstra and J. Klop. Decidability of bisimulation equivalence for processes generating context-free languages. Journal of Association of Computing Machinery 40:653–682, 1993.
J. van Benthem. Correspondence theory. In Handbook of Philosophical Logic, Vol. II, ed. Gabbay, D. and Guenthner, F., 167–248, Reidel, 1994.
van Benthem, J. Exploring Logical Dynamics. CSLI Publications, Stanford, 1996.
O. Burkart, D. Caucal and B. Steffen. Bisimulation collapse and the process taxonomy. Lecture Notes in Computer Science 1119:247–262, 1996.
D. Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science 106:61–86, 1992.
D. Caucal. On infinite transition graphs having a decidable monadic theory. Lecture Notes in Computer Science 1099:194–205, 1996.
S. Christensen, H. Hüttel and C. Stirling. Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121:143–148, 1995.
A. Dawar. A restricted second-order logic for finite structures, Information and Computation 143:154–174, 1998.
J. Groote. Transition system specifications with negative premises. Theoretical Computer Science 118:263–299, 1993.
Groote, J., and Hüttel, H. Undecidable equivalences for basic process algebra. Information and Computation 115:354–371, 1994.
M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery 32:137–162, 1985.
D. Janin and I. Walukiewicz. On the expressive completeness of the propositional mu-calculus with respect to the monadic second order logic. Lecture Notes in Computer Science 1119:263–277, 1996.
D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science 27:333–354, 1983.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
M. Otto. Bisimulation-invariant ptime and higher-dimensional μ-calculus. Theoretical Computer Science, 224:73–113, 1999.
D. Park. Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 154:561–572, 1981.
E. Rosen. Modal logic over finite structures. Journal of Logic, Language and Information 6:427–439, 1997.
J. Rutten. 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, Stanford. 1995.
G. Sénizergues. The equivalence problem for deterministic pushdown automata is decidable. Lecture Notes in Computer Science 1256:671–681, 1997.
G. Sénizergues. L(A) = L(B)? decidability results from complete formal systems. Theoretical Computer Science 251:1–166,2001
G. Sénizergues. Decidability of bisimulation equivalence for equational graphs of finite out-degree. Procs IEEE FOCS 98, 120–129, 1998.
C. Stirling. Decidability of DPDA equivalence. Theoretical Computer Science, 255:1–31, 2001.
L. Stockmeyer and A. Meyer. Word problems requiring exponential time. Procs. 5th ACM STOC, 1–9, 1973.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Kluwer Academic Publishers
About this chapter
Cite this chapter
Stirling, C. (2003). Bisimulation and Language Equivalence. In: de Queiroz, R.J.G.B. (eds) Logic for Concurrency and Synchronisation. Trends in Logic, vol 15. Springer, Dordrecht. https://doi.org/10.1007/0-306-48088-3_7
Download citation
DOI: https://doi.org/10.1007/0-306-48088-3_7
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-1270-9
Online ISBN: 978-0-306-48088-1
eBook Packages: Springer Book Archive