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}
}
  • Hans Hüttel, C. Stirling
  • Published 15 July 1991
  • Computer Science
  • [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science
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… 

Undecidable Equivalences for Basic Process Algebra

TLDR
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.

Decidability of bisimulation equivalence for process generating context-free languages

TLDR
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

TLDR
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

TLDR
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.

An Introduction to Decidability of DPDA Equivalence

TLDR
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

TLDR
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.

Distributed Bisimularity is Decidable for a Class of Infinite State-Space Systems

TLDR
This paper shows that distributed bisimulation [2] is decidable on the language Ρ, and the proof of decidability relies on a tableau decision method as utilised by Huttel and Stirling in [6].

Expansive-Bisimulation for Context-Free Processes

  • Xinxin Liu
  • Computer Science
    Formal Methods and Hybrid Real-Time Systems
  • 2007
TLDR
This paper shows that two context-free processes are bisimulation equivalent if and only if there is a finite expansive-bisimulation which contains them, which immediately suggests the set of finite expansive Bisimulation as a complete class of verifiable evidence for bisimulations equality of context- free processes.

Decidability, Behavioural Equivalences and Infinite Transition Graphs

This thesis studies behavioural equivalences on labelled infinite transition graphs and the role that they can play in the context of modal logics and notions from language theory. A natural class of
...

References

SHOWING 1-10 OF 22 REFERENCES

Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages

TLDR
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

TLDR
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

  • D. Park
  • Computer Science
    Theoretical Computer Science
  • 1981
TLDR
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.

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

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

TLDR
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.

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

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

  • C. StirlingD. Walker
  • Mathematics, Computer Science
    Automatic Verification Methods for Finite State Systems
  • 1989
TLDR
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.

Verifying Temporal Properties of Processes

TLDR
This paper presents a sound and complete tableau system for proving temporal properties of states (processes or markings) in arbitrary infinite transition system models and extends local model checking techniques as presented in [4, 7, 11, 14].

Simple Deterministic Languages

TLDR
The s-languages are those languages recognized by a particular restricted form of deterministic pushdown automaton, called an s-machine, and it is shown that they have the prefix property, and that they include the regular sets with end-markers.