14 search results - page 1 / 3 » Bisimulation Equivalence is Decidable for One-Counter Proces... |
74
Voted
ICALP
1997
Springer
15 years 5 months ago
1997
Springer
89
Voted
TCS
1998
15 years 21 days ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.
107
Voted
ICALP
1998
Springer
15 years 5 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...
117
Voted
PARLE
1987
15 years 4 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...
75
Voted
CONCUR
1992
Springer
15 years 5 months ago
1992
Springer
