36 search results - page 1 / 8 » Bisimulation Equivalence is Decidable for all Context-Free P... |
60
Voted
CONCUR
1992
Springer
15 years 3 months ago
1992
Springer
96
Voted
PARLE
1987
15 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...
108
Voted
LICS
1991
IEEE
15 years 2 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
91
Voted
CONCUR
2009
Springer
15 years 5 months 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...
72
Voted
TCS
1998
14 years 10 months ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.