12 search results - page 2 / 3 » Deciding Bisimilarity between BPA and BPP Processes |
CONCUR
2009
Springer
14 years 6 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
MFCS
1998
Springer
13 years 9 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
1999
Springer
13 years 10 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...
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
2000
Springer
13 years 9 months ago
2000
Springer
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between process...