8 search results - page 1 / 2 » Normed BPA vs. Normed BPP Revisited |
CONCUR
2008
Springer
14 years 24 days ago
2008
Springer
CONCUR
2009
Springer
14 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...
IANDC
2010
13 years 9 months ago
2010
We present a polynomial-time algorithm deciding bisimilarity between a normed BPA process and a normed BPP process, with running time O(n7 ). This improves the previously known ex...
ACTA
1999
13 years 10 months ago
1999
APLAS
2009
ACM
14 years 3 months ago
2009
ACM
In this paper we present polynomial time algorithms deciding branching bisimilarity between finite-state systems and several classes of infinite-state systems: BPA and normed BPP...