15 search results - page 2 / 3 » Decidability of Bisimulation Equivalence for Processes Gener... |
ICALP
1997
Springer
13 years 10 months ago
1997
Springer
MFCS
1998
Springer
13 years 10 months ago
1998
Springer
Recently the class of BPA (or context-free) processes has been intensively studied and bisimilarity and regularity appeared to be decidable (see [CHS95, BCS95, BCS96]). We extend t...
ICALP
1998
Springer
13 years 10 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
1998
Springer
13 years 10 months ago
1998
Springer
We generate a natural hierarchy of equivalences for asynchronous name-passing process calculi from simple variations on Milner and Sangiorgi's definition of weak barbed bisim...
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...