AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nondeterministic) pushdown automata, where the pushdown behaves like a counter. Also finiteness up to bisimilarity is shown to be decidable for the mentioned processes
We answer an open question related to bisimilarity checking on labelled transition systems generated...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we st...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterminis...
We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transitions
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
AbstractWe prove that bisimulation equivalence is decidable for normed pushdown processes
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
Abstract. A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove ...
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecif...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
We answer an open question related to bisimilarity checking on labelled transition systems generated...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we st...
AbstractIt is shown that bisimulation equivalence is decidable for the processes generated by (nonde...
It is shown that bisimulation equivalence is decidable for the processes generated by (nondeterminis...
We show that bisimulation equivalence is decidable for pushdown automata without epsilon-transitions
Stirling (1996, 1998) proved the decidability of bisimilarity on so called normed pushdown processes...
AbstractWe prove that bisimulation equivalence is decidable for normed pushdown processes
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
Abstract. A one-counter automaton is a pushdown automaton over a singleton stack alphabet. We prove ...
The problem if a given configuration of a pushdown automaton (PDA) is bisimilar with some (unspecif...
AbstractWeak bisimilarity is one of the most studied behavioural equivalences. This equivalence is u...
AbstractWe study the problem of bisimilarity-checking between processes of one-counter automata and ...
AbstractWe establish Σ11-completeness (in the analytical hierarchy) of weak bisimilarity checking fo...
We study the bisimilarity problem for probabilistic pushdown automata (pPDA) and subclasses thereof....
We answer an open question related to bisimilarity checking on labelled transition systems generated...
We design a general method for proving decidability of bisimulation-like equivalences between infini...
We show that bisimulation equivalence of order-two pushdown automata is undecidable. Moreover, we st...
DOI
Add to ORKG