# Actions speak louder than words: proving bisimilarity for context-free processes

@article{Httel1991ActionsSL, title={Actions speak louder than words: proving bisimilarity for context-free processes}, author={Hans H{\"u}ttel and Colin Stirling}, journal={[1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science}, year={1991}, pages={376-386} }

J.C.M. Baeten et al. (Lecture Notes in Computer Science, vol. 259, pp. 93-114, 1987) proved that bisimulation equivalence is decidable for irredundant context-free grammars. A much simpler and much more direct proof of this result is provided now. It uses a tableau decision method involving goal-directed rules. The decision procedure yields an upper bound on a tableau depth. Moreover, it provides the essential part of the bisimulation relation between two processes which underlies their…

## 83 Citations

### Undecidable Equivalences for Basic Process Algebra

- Computer ScienceInf. Comput.
- 1994

All other equivalences in the linear/branching time hierarchy are examined and it is shown that none of them are decidable for normed BPA processes.

### Bisimulation Collapse and the Process Taxonomy

- MathematicsCONCUR
- 1996

It turns out that almost none of the more complex classes of the process taxonomy, which has been established in the last years, are preserved by the factorization (collapse) of infinite transition graphs wrt.

### Bisimulation Equivalence is Decidable for All Context-Free Processes

- Computer ScienceInf. Comput.
- 1992

It is shown that bisimulation equivalence is decidable for BPA and this result would be a proper extension of Milner's axiom system for regular processes for normed BPA processes.

### Decidability of bisimulation equivalence for process generating context-free languages

- Computer ScienceJACM
- 1993

A short proof of the solvability of the equivalence problem for simple context-free languages is given and a model of process graphs modulo bisimulation equivalence is given.

### Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes

- Computer ScienceFoSSaCS
- 2001

For full Petri nets Jancar proved that bisimulation equivalence is undecidable, and decidability of bisimilarity was also shown for Basic Parallel processes, a restricted subset of Petrinets.

### Decidable Subsets of CCS

- Computer ScienceComput. J.
- 1994

The limits of decidability of CCS are demonstrated: by simply disallowing either of communication or both restriction and relabelling, one arrives at a sub-language which still describes a rich class of infinite state systems but for which bisimulation is decidable.

### A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes

- Computer ScienceTheor. Comput. Sci.
- 1996

### An Introduction to Decidability of DPDA Equivalence

- MathematicsFSTTCS
- 2001

The DPDA equivalence problem was posed in 1966 and remained unsolved until 1997 when Senizergues announced a positive solution, but it seems that the notation of pushdown configurations, although simple, is not rich enough to sustain a proof.

### An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes

- Computer ScienceMFCS
- 1995

The point of the algorithm is the effective construction of a finite relation characterizing all bisimulation equivalence classes, whose mere existence was exploited for the decidability result.

## References

SHOWING 1-10 OF 22 REFERENCES

### Bisimulation Equivalence is Decidable for All Context-Free Processes

- Computer ScienceInf. Comput.
- 1992

It is shown that bisimulation equivalence is decidable for BPA and this result would be a proper extension of Milner's axiom system for regular processes for normed BPA processes.

### Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages

- Computer SciencePARLE
- 1987

A short proof of the solvability of the equivalence problem for simple context-free languages is given and a model of process graphs modulo bisimulation equivalence is given.

### Decidability of bisimulation equivalence for process generating context-free languages

- Computer ScienceJACM
- 1993

A short proof of the solvability of the equivalence problem for simple context-free languages is given and a model of process graphs modulo bisimulation equivalence is given.

### Concurrency and Automata on Infinite Sequences

- Computer ScienceTheoretical Computer Science
- 1981

A general method for proving/deciding equivalences between omega-regular languages, whose recognizers are modified forms of Buchi or Muller-McNaughton automata, derived from Milner's notion of “simulation” is obtained.

### A Short Proof of the Decidability of Bisimulation for Normed BPA-Processes

- MathematicsInf. Process. Lett.
- 1992

### Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes

- Mathematics[1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science
- 1993

The authors prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely, the so-called normed and live…

### Process theory based on bisimulation semantics

- Computer ScienceREX Workshop
- 1988

In this paper a process is viewed as a labeled graph modulo bisimulation equivalence and inference systems which are complete for proving the equivalence of regular (finite state) processes are discussed.

### Algebraic laws for nondeterminism and concurrency

- Computer ScienceJACM
- 1985

The paper demonstrates, for a sequence of simple languages expressing finite behaviors, that in each case observation congruence can be axiomatized algebraically and the algebraic language described here becomes a calculus for writing and specifying concurrent programs and for proving their properties.

### Silence is Golden: Branching Bisimilarity is Decidable for Context-Free Processes

- MathematicsCAV
- 1991

We show that the branching bisimulation equivalence introduced by Rob van Glabbeek is decidable for the class of normed, recursively defined BPA processes with silent actions, thus generalizing the…

### CCS, Liveness, and Local Model Checking in the Linear Time Mu-Calculus

- Mathematics, Computer ScienceAutomatic Verification Methods for Finite State Systems
- 1989

It is shown that observation equivalence on CCS processes preserves temporal properties (drawn from a very general temporal logic encompassing standard linear and branching time logics) and a correct model checker for a sublogic, the linear time mu-calculus, of the general temporal Logic is exhibited.