14 search results - page 1 / 3 » Bisimulation Equivalence is Decidable for One-Counter Proces... |
ICALP
1997
Springer
14 years 3 months ago
1997
Springer
TCS
1998
13 years 10 months ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.
ICALP
1998
Springer
14 years 3 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...
PARLE
1987
14 years 2 months ago
1987
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
CONCUR
1992
Springer
14 years 3 months ago
1992
Springer
