Results 11 -
12 of
12
Weak Bisimilarity between Finite-State Systems and BPA or Normed BPP is Decidable in Polynomial Time
- Theoretical Computer Science
, 2000
"... We prove that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We prove that weak bisimilarity is decidable in polynomial time between finite-state systems and several classes of infinite-state systems: context-free processes (BPA) and normed Basic Parallel Processes (normed BPP). To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity problems involving infinite-state systems.
