19 search results - page 1 / 4 » Branching Bisimulation for Context-free Processes |
CONCUR
2008
Springer
13 years 8 months ago
2008
Springer
A well-known theorem in automata theory states that every context-free language is accepted by a pushdown automaton. We investigate this theorem in the setting of processes, using ...
LICS
1991
IEEE
13 years 10 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 ...
PARLE
1987
13 years 10 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
13 years 11 months ago
1992
Springer
CONCUR
2009
Springer
14 years 1 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...