Bisimulation and language equivalence

Authors:
Colin Stirling
Affiliations:
Division of Informatics, Edinburgh University, Scotland
Venue:
Logic for concurrency and synchronisation
Year:
2003

Citing 19
Cited 2

Algebraic laws for nondeterminism and concurrency

Journal of the ACM (JACM)
On the regular structure of prefix rewriting

CAAP '90 Selected papers of the conference on Fifteenth colloquium on trees in algebra and programming
Transition system specifications with negative premises

Theoretical Computer Science
Decidability of bisimulation equivalence for process generating context-free languages

Journal of the ACM (JACM)
Undecidable equivalences for basic process algebra

Information and Computation
Bisimulation equivalence is decidable for all context-free processes

Information and Computation
Exploring logical dynamics

Exploring logical dynamics
A restricted second order logic for finite structures

Information and Computation
Bisimulation-invariant PTIME and higher-dimensional &mgr;-calculus

Theoretical Computer Science
L(A) = L(B)? decidability results from complete formal systems

Theoretical Computer Science
Decidability of DPDA equivalence

Theoretical Computer Science
Communication and Concurrency

Communication and Concurrency
Modal Logic over Finite Structures

Journal of Logic, Language and Information
On Infinite Transition Graphs Having a Decidable Monadic Theory

ICALP '96 Proceedings of the 23rd International Colloquium on Automata, Languages and Programming
The Equivalence Problem for Deterministic Pushdown Automata is Decidable

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On the Expressive Completeness of the Propositional mu-Calculus with Respect to Monadic Second Order Logic

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Bisimulation Collapse and the Process Taxonomy

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Decidability of Bisimulation Equivalence for Equational Graphs of Finite Out-Degree

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Word problems requiring exponential time(Preliminary Report)

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing

Undecidability of bisimilarity by defender's forcing

Journal of the ACM (JACM)
Undecidability results for bisimilarity on prefix rewrite systems

FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

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.