Abstract. We prove that weak bisimilarity is decidable in polynomial time between BPA and finite-state processes, and between normed BPP and finite-state processes. To the best of our knowledge, these are the first polynomial algorithms for weak bisimilarity with infinite-state systems. 1
|
2869
|
Introduction to Automata Theory, Languages and Computation
– Hopcroft, Ullman
- 1979
|
|
2807
|
Communication and Concurrency
– Milner
- 1989
|
|
551
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
270
|
Three Partition Refinement Algorithms
– Paige, Tarjan
- 1987
|
|
210
|
Reachability analysis of pushdown automata: application to model-checking
– Bouajjani, Esparza, et al.
- 1997
|
|
101
|
Decidability of bisimulation equivalence for processes generating context-free languages
– Baeten, Bergstra, et al.
- 1993
|
|
93
|
Bisimulation equivalence is decidable for all context-free processes
– Christensen, Hüttel, et al.
- 1992
|
|
65
|
Infinite results
– Moller
- 1996
|
|
52
|
An automata-theoretic approach to interprocedural data-flow analysis
– Esparza, Knoop
- 1999
|
|
49
|
Decidability of model checking for infinite-state concurrent systems
– Esparza
- 1997
|
|
44
|
Actions speak louder than words: Proving bisimilarity for contextfree processes
– Hüttel, Stirling
|
|
39
|
Petri nets, commutative context-free grammars, and basic parallel processes
– Esparza
- 1997
|
|
39
|
Deciding bisimulation-like equivalences with finite-state processes
– Jančar, Kučera, et al.
|
|
36
|
A polynomial algorithm for deciding bisimilarity of normed context-free processes
– Hirshfeld, Jerrum, et al.
- 1996
|
|
33
|
More infinite results
– Burkart, Esparza
- 1996
|
|
27
|
A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes
– Hirshfeld, Jerrum, et al.
- 1996
|
|
24
|
Bisimulation is decidable for all basic parallel processes
– Christensen, Hirshfeld, et al.
|
|
22
|
An elementary decision procedure for arbitrary context-free processes
– Burkart, Caucal, et al.
- 1995
|
|
20
|
A short proof of the decidability of bisimulation for normed BPA processes
– Groote
- 1992
|
|
19
|
Bisimulation trees and the decidability of weak bisimulation
– Hirshfeld
|
|
19
|
Weak bisimulation and model checking for basic parallel processes
– Mayr
- 1996
|
|
15
|
Graphes canoniques des graphes algébriques
– Caucal
- 1990
|
|
11
|
Weak bisimilarity with infinite-state systems can be decided in polynomial time
– Kučera, Mayr
- 1998
|
|
10
|
Simulation preorder on simple process algebras
– Kucera, Mayr
- 1999
|
|
8
|
Strict lower bounds for model checking BPA
– Mayr
- 1998
|
|
7
|
Comparing expressibility of normed BPA and normed BPP processes
– Cern'a, Kret'insk'y, et al.
- 1999
|
|
5
|
Process rewrite systems. Information and Computation
– Mayr
|
|
4
|
Hardness results for weak bisimilarity of simple process algebras
– Strbrna
- 1998
|
|
3
|
On effective decomposability of sequential behaviours
– Kucera
|
|
