Decidability of Weak Bisimilarity for a Subset of Basic Parallel Processes
Colin Stirling
- pp 379-393
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.Abstract:
In the past decade there has been a variety of results showing decidability of bisimulation equivalence between infinite state systems. The initial result, due to Baeten, Bergstra and Klop [1], proved decidability for normed BPA processes, described using irredundant context-free grammars. This was extended to all BPA processes and then to pushdown automata [5,16,14]. Decidability of bisimilarity was also shown for Basic Parallel (BP) processes, a restricted subset of Petri nets, [4]. For full Petri nets Jancar proved that bisimulation equivalence is undecidable [11].read more
Citations
More filters
Book ChapterDOI
The algorithmics of bisimilarity
TL;DR: In this article, a process algebra is used to describe both implementations of processes and specifications of their expected behaviours, and a process description, say SYS, may describe an implementation and a specification of the expected behaviour, is taken to indicate that these two processes describe essentially the same behaviour, albeit at different levels of abstraction or refinement.
Book ChapterDOI
Undecidability of Weak Bisimilarity for Pushdown Processes
TL;DR: In this article, it was shown undecidability of the problem of determining whether a given pair of pushdown processes is weakly bisimilar, and this undecidable result extends to a subclass of processes satisfying the normedness condition.
Undecidability of Weak Bisimilarity for Pushdown Processes
TL;DR: It is proved undecidability of the problem whether a given pair of pushdown processes is weakly bisimilar and this result extends to a subclass of push down processes satisfying the normedness condition.
Proceedings Article
Note on the Tableau Technique for Commutative Transition Systems
TL;DR: It is shown, by generalising a tableau-based proof for BPP, that strong bisimilarity between any two states of such a transition system is decidable and gives a general technique for extending decidability borders of strong bis similarity for a wide class of infinite-state transition systems.
Book ChapterDOI
Decidability of branching bisimulation on normed commutative context-free processes
TL;DR: It is shown that branching bisimilarity admits the small response property: in the Bisimulation Game, Duplicator always has a response leading to a process of size linearly bounded with respect to the Spoiler's process, which leads to decidability of branching Bisimilarity.
References
More filters
Book
Communication and Concurrency
TL;DR: This chapter discusses Bisimulation and Observation Equivalence as a Modelling Communication, a Programming Language, and its application to Equational laws.
Decidability of bisimulation equivalence for processes generating context-free languages
TL;DR: In this paper, the equality on processes is given by a model of process graphs modulo bisimulation equivalence, and a short proof of the equivalence problem for simple context-free languages is given.
Journal ArticleDOI
Decidability of bisimulation equivalence for process generating context-free languages
TL;DR: 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.
Journal ArticleDOI
Bisimulation equivalence is decidable for all context-free processes
TL;DR: This paper answers the question in the affirmative of whether bisimulation is decidable for the full BPA language using a proof technique based on the proof by Caucal of the decidability of language equivalence for simple algebraic grammars.