Results 1 
6 of
6
Bisimulation Equivalence is Decidable for all ContextFree Processes
 Information and Computation
, 1995
"... Introduction Over the past decade much attention has been devoted to the study of process calculi such as CCS, ACP and CSP [13]. Of particular interest has been the study of the behavioural semantics of these calculi as given by labelled transition graphs. One important question is when processes c ..."
Abstract

Cited by 92 (15 self)
 Add to MetaCart
Introduction Over the past decade much attention has been devoted to the study of process calculi such as CCS, ACP and CSP [13]. Of particular interest has been the study of the behavioural semantics of these calculi as given by labelled transition graphs. One important question is when processes can be said to exhibit the same behaviour, and a plethora of behavioural equivalences exists today. Their main rationale has been to capture behavioural aspects that language or trace equivalences do not take into account. The theory of finitestate systems and their equivalences can now be said to be wellestablished. There are many automatic verification tools for their analysis which incorporate equivalence checking. Sound and complete equational theories exist for the various known equivalences, an elegant example is [18]. One may be led to wonder what the results will look like for infinitestate systems. Although language equivalence is decidable
Actions Speak Louder than Words: Proving Bisimilarity for ContextFree Processes
, 1991
"... Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirec ..."
Abstract

Cited by 45 (9 self)
 Add to MetaCart
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant contextfree grammars. In this paper we provide a much simpler and much more direct proof of this result using a tableau decision method involving goaldirected rules. The decision procedure also provides the essential part of the bisimulation relation between two processes which underlies their equivalence. We also show how to obtain a sound and complete sequentbased equational theory for such processes from the tableau system and how one can extract what Caucal calls a fundamental relation from a successful tableau.
Decidability of Bisimulation Equivalence for Normed Pushdown Processes
 Theoretical Computer Science
, 1996
"... We prove that bisimulation equivalence is decidable for normed pushdown processes. 1 Introduction In the classical theory of automata the expressive power of pushdown automata is matched by contextfree grammars. Both accept the same family of languages, the contextfree languages. Concurrency theo ..."
Abstract

Cited by 24 (7 self)
 Add to MetaCart
We prove that bisimulation equivalence is decidable for normed pushdown processes. 1 Introduction In the classical theory of automata the expressive power of pushdown automata is matched by contextfree grammars. Both accept the same family of languages, the contextfree languages. Concurrency theory requires a more intensional exposition of behaviour (as language equivalence need not be preserved in the presence of communicating abstract machines). Many finer equivalences have been proposed. Bisimulation equivalence, due to Park and Milner, has received much attention. Baeten, Bergstra and Klop proved that bisimulation equivalence is decidable for irredundant contextfree grammars (without the empty production) . Within process calculus theory these grammars correspond to normed BPA processes. Their proof relies on isolating a complex periodicity from the transition graphs of these processes. Simpler proofs of the result soon followed which expose algebraic structure. Caucal and Monf...
Decidable Subsets of CCS
"... CCS is a universal formalism: any computable function is computed by some CCS agent. Moreover, one can reduce the halting problem for Turing machines to the problem of deciding bisimilarity of two CCS agents, thus demonstrating the undecidability of the equivalence checking problem. In this paper, ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
CCS is a universal formalism: any computable function is computed by some CCS agent. Moreover, one can reduce the halting problem for Turing machines to the problem of deciding bisimilarity of two CCS agents, thus demonstrating the undecidability of the equivalence checking problem. In this paper, we demonstrate the limits of decidability of CCS. In particular, we show that by simply disallowing either of communication or both restriction and relabelling, we arrive at a sublanguage which still describes a rich class of infinite state systems but for which bisimulation is decidable. We also demonstrate complete axiomatisations for these sublanguages. We compare these results with the undecidability of all other common equivalences.
A Taxonomy of Infinite State Processes
 Electronic Notes in Theoretical Computer Science
, 1998
"... In this tutorial paper, we consider various classes of automata generated by simple rewrite transition systems. These classes are defined by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting conc ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
In this tutorial paper, we consider various classes of automata generated by simple rewrite transition systems. These classes are defined by two natural hierarchies, one given by interpreting concatenation of symbols in the rewrite system as sequential composition, and the other by interpreting concatenation as parallel composition. In this way we provide natural definitions for commutative (parallel) contextfree automata, multiset (parallel, or random access, pushdown) automata, and Petri nets. 1