Weak Bisimilarity between Finite-State Systems and BPA or Normed BPP is Decidable in Polynomial Time (2000)
by
Antonin Kucera
,
Richard Mayr
| Venue: | Theoretical Computer Science |
| Citations: | 1 - 0 self |
BibTeX
@ARTICLE{Kucera00weakbisimilarity,
author = {Antonin Kucera and Richard Mayr},
title = {Weak Bisimilarity between Finite-State Systems and BPA or Normed BPP is Decidable in Polynomial Time},
journal = {Theoretical Computer Science},
year = {2000},
volume = {270},
pages = {2002}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
Citations
| 239 | O.: Reachability analysis of pushdown automata: Application to model-checking - Bouajjani, Esparza, et al. - 1997 |
| 92 | Decidability of bisimulation equivalence for processes generating context-free languages - Baeten, Bergstra, et al. - 1993 |
| 76 | Decidability and Decomposition in Process Algebras - Christensen - 1993 |
| 34 | More infinite results - Burkart, Ezparza |
| 21 | An elementary decision procedure for arbitrary contextfree processes - Burkart, Caucal, et al. - 1995 |
| 19 | Bisimulation is decidable for all basic parallel processes - Christensen, Hirshfeld, et al. - 1993 |
| 14 | Graphes canoniques de graphes algébriques - Caucal - 1990 |
| 5 | Comparing expressibility of normed BPA and normed BPP processes - Cern'a, Kret'insk'y, et al. - 1999 |
