Undecidability of bisimilarity by defender's forcing

@article{Jancar2008UndecidabilityOB,
  title={Undecidability of bisimilarity by defender's forcing},
  author={Petr Jancar and Jir{\'i} Srba},
  journal={J. ACM},
  year={2008},
  volume={55},
  pages={5:1-5:26}
}
Stirling [1996, 1998] proved the decidability of bisimilarity on so-called normed pushdown processes. This result was substantially extended by Sénizergues [1998, 2005] who showed the decidability of bisimilarity for regular (or equational) graphs of finite out-degree; this essentially coincides with weak bisimilarity of processes generated by (unnormed) pushdown automata where the ϵ-transitions can only deterministically pop the stack. The question of decidability of bisimilarity for the more… Expand
Bisimulation equivalence of first-order grammars is Ackermann-hard
  • P. Jancar
  • Computer Science, Mathematics
  • ArXiv
  • 2013
TLDR
The proof is based on a (polynomial) reduction from the reachability problem of reset (or lossy) counter machines, for which the Ackermann-hardness has been shown by Schnoebelen (2010); in fact, this Reachability problem is known to be AckermanN-complete in the hierarchy of fast-growing complexity classes defined by Schmitz (2013). Expand
Finiteness up to bisimilarity is decidable for pushdown processes
  • P. Jancar
  • Mathematics, Computer Science
  • ArXiv
  • 2013
It is shown that it is decidable if a given configuration of a pushdown automaton (pda) with no epsilon-transitions is bisimulation equivalent with some unspecified finite-state process. While theExpand
Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)
  • P. Jancar
  • Mathematics, Computer Science
  • Log. Methods Comput. Sci.
  • 2012
TLDR
A self-contained direct proof of the membership in 2-ExpTime is given via a Prover-Refuter game which shows that there is an alternating Turing machine deciding the problem in exponential space. Expand
Deciding semantic finiteness of pushdown processes and first-order grammars w.r.t. bisimulation equivalence
  • P. Jancar
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 2020
Abstract The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in theExpand
Decidability of Epsilon Pushing PDA
Sénizergues proved that language equivalence is decidable for disjoint -deterministic pushdown automata (PDA). Stirling showed that strong bisimilarity is decidable for normed PDA. SénizerguesExpand
Selected Ideas Used for Decidability and Undecidability of Bisimilarity
  • P. Jancar
  • Mathematics, Computer Science
  • Developments in Language Theory
  • 2008
The paper tries to highlight some crucial ideas appearing in the decidability and undecidability proofs for the bisimilarity problem on models originating in language theory, like context-freeExpand
EXPSPACE-hardness of behavioural equivalences of succinct one-counter nets
TLDR
A direct self-contained EXPSPACE-hardness proof is given for reachability games on succinct one counter nets and is reduced to (bi)simulation games by using a standard "defender-choice" technique. Expand
Computational Complexity of Some Equivalence-Checking Problems
This habilitation thesis gives an overview of five papers of the author in the area of verification, in particular, in the study of computational complexity of equivalence checking problems andExpand
Deciding Semantic Finiteness of Pushdown Processes and First-Order Grammars w.r.t. Bisimulation Equivalence
  • P. Jancar
  • Mathematics, Computer Science
  • MFCS
  • 2016
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecified) finite-state process is shown to be decidable. The decidability is proven in the framework ofExpand
The Decidability of-Pushing PDA
Sénizergues has proved that language equivalence is decidable for disjoint -deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side SrbaExpand
...
1
2
3
4
...

References

SHOWING 1-10 OF 68 REFERENCES
Undecidability Results for Bisimilarity on Prefix RewriteSystems
We answer an open question related to bisimilarity checking on labelled transition systems generated by prefix rewrite rules on words. Stirling (1996, 1998) proved the decidability of bisimilarityExpand
Undecidability Results for Bisimilarity on Prefix Rewrite Systems
TLDR
Undecidability of bisimilarity is shown on Type -1 systems, even in the normed case, by considering classes of systems that use rewrite rules of the form w and R and showing when they yield low undecidable and high undecido, all with and without the assumption of normedness. Expand
Bisimulation Equivalence is Decidable for All Context-Free Processes
TLDR
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. Expand
Bisimulation Of Context-Free Grammars And Of Pushdown Automata
We consider the bisimulation on the transition graphs of pushdown automata. First we give a characterization of bisimulation using the unfolded trees. We recall that the bisimulation is decidable forExpand
Undecidability of Bisimilarity for Petri Nets and Some Related Problems
  • P. Jancar
  • Computer Science, Mathematics
  • Theor. Comput. Sci.
  • 1995
TLDR
The main result shows the undecidability of (strong) bisimilarity for labelled (place/transition) Petri nets for Semilinear bisimulations. Expand
On the Complexity of Semantic Equivalences for Pushdown Automata and BPA
TLDR
It is shown that strong and weak simulation preorder (and hence simulation equivalence) is EXPTIME-complete between PDA/BPA and finite-state systems in both directions, while strong (and weak) bisimilarity between two PDAs is EX PTIME-hard. Expand
Undecidability of bisimilarity by defender's forcing
Stirling 1996, 1998 proved the decidability of bisimilarity on so-called normed pushdown processes. This result was substantially extended by Snizergues 1998, 2005 who showed the decidability of bi...
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. Expand
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. Expand
A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes
TLDR
A polynomial algorithm for the equivalence problem for simple context-free grammars is presented, which solves the problem of deciding bisimilarity between normed context- free processes. Expand
...
1
2
3
4
5
...