17 search results - page 1 / 4 » Decidability of Bisimulation Equivalence for Normed Pushdown... |
TCS
1998
13 years 5 months ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.
ENTCS
2006
13 years 5 months ago
2006
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
ICALP
1998
Springer
13 years 9 months ago
1998
Springer
We show that characteristic formulae for nite-state systems up to bisimulationlike equivalences (e.g., strong and weak bisimilarity) can be given in the simple branching-time temp...
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
CSL
2006
Springer
13 years 9 months ago
2006
Springer
Abstract. We investigate the possibility of (bi)simulation-like preorder/equivalence checking on the class of visibly pushdown automata and its natural subclasses visibly BPA (Basi...