We prove that bisimulation equivalence is decidable for normed pushdown processes. 1
|
2818
|
Introduction to Automata Theory, Languages, and Computation
– Hopcroft, Ullman
- 1979
|
|
101
|
Decidability of bisimulation equivalence for processes generating context-free languages
– Baeten, Bergstra, et al.
- 1993
|
|
96
|
The theory of ends, pushdown automata, and second-order logic’, Theoret
– Muller, Schupp
- 1985
|
|
92
|
Bisimulation equivalence is decidable for all context-free processes
– Christensen, Hüttel, et al.
- 1995
|
|
73
|
On infinite graphs having a decidable monadic theory
– Caucal
- 2002
|
|
67
|
On the regular structure of prefix rewriting
– Caucal
- 1992
|
|
65
|
Infinite results
– Moller
- 1996
|
|
44
|
Actions speak louder than words: Proving bisimilarity for contextfree processes
– Hüttel, Stirling
|
|
42
|
Bisimulation collapse and the process taxonomy
– Burkart, Caucal, et al.
- 1996
|
|
36
|
A polynomial algorithm for deciding bisimilarity of normed context-free processes
– Hirshfeld, Jerrum, et al.
- 1996
|
|
34
|
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
– Christensen, Hirshfeld, et al.
- 1993
|
|
34
|
Undecidable equivalences for basic process algebra
– Groote, Huttel
- 1994
|
|
32
|
Composition, decomposition and model checking of pushdown processes
– Burkart, Steffen
- 1995
|
|
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
|
|
20
|
Undecidable Equivalence for Basic Parallel Processes
– Hüttel
- 1994
|
|
18
|
Bisimulation trees and the decidability of weak bisimulations
– Hirshfeld
- 1996
|
|
16
|
On the Transition Graphs of Automata and Grammars
– Caucal, Monfort
- 1990
|
|
16
|
Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems
– Jancar
- 1994
|
|
14
|
Bisimulation of context-free grammars and of pushdown automata. In Modal logic and process algebra
– Caucal
- 1994
|
|
10
|
Bisimulation is decidable for basic parallel processes
– Christensen, Hirshfeld, et al.
- 1993
|
|
10
|
The equivalence problem for real-time strict deterministic languages
– Oyamaguchi, Honda, et al.
- 1980
|
|
8
|
Graphes canoniques de graphes alg'ebriques. Informatique th'eorique et
– Caucal
- 1990
|
|
5
|
Recursive process definitions with the state operator
– Baeten, Bergstra
- 1991
|
|
4
|
Deciding Equivalences in Simple Process Algebras
– Hirshfeld
- 1994
|
|
3
|
Decidability questions for bisimilarity of Petri nets and some related problems
– car
- 1994
|
|
2
|
Undecidable equivalences for basic parallel processes
– UTTEL
- 1994
|
|
1
|
Actions speak louder than words: proving bisimilarity for context free processes
– uttel, H, et al.
- 1991
|
|
