|
2860
|
Communication and Concurrency
– Milner
- 1989
|
|
638
|
Term rewriting and all that
– Baader, Nipkow
- 1998
|
|
222
|
An automata-theoretic approach to branching-time model checking
– Bernholtz, Vardi, et al.
- 1994
|
|
214
|
Reachability analysis of pushdown automata: Application to model-checking
– Bouajjani, Esparza, et al.
- 1997
|
|
104
|
Tree automata techniques and applications
– Comon, Dauchet, et al.
- 1997
|
|
103
|
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
– Baeten, Bergstra, et al.
- 1993
|
|
102
|
A direct symbolic approach to model checking pushdown systems
– Finkel, Willems, et al.
- 1997
|
|
91
|
Tree languages
– Gécseg, Steinby
- 1997
|
|
77
|
Decidability and Decomposition in Process Algebras
– Christensen
- 1993
|
|
68
|
On the regular structure of prefix rewriting
– Caucal
- 1992
|
|
66
|
Infinite results
– Moller
- 1996
|
|
53
|
An automata-theoretic approach to interprocedural data-flow analysis
– Esparza, Knoop
- 1999
|
|
48
|
The theory of ground rewrite systems is decidable
– Dauchet, Tison
- 1990
|
|
40
|
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
– Esparza
- 1997
|
|
39
|
Deciding bisimulation-like equivalences with finite-state processes
– Jancar, Kucera, et al.
- 1998
|
|
33
|
More infinite results
– Burkart, Esparza
- 1997
|
|
28
|
Bisimulation equivalence is decidable for normed process algebra
– Hirshfeld, Jerrum
- 1999
|
|
21
|
Regular canonical systems
– Büchi
- 1964
|
|
20
|
Regularity is decidable for normed PA processes in polynomial time
– Kucera
- 1996
|
|
14
|
Verifying Infinite State Processes with Sequential and Parallel Composition
– Bouajjani, Echahed, et al.
- 1995
|
|
11
|
Decidable subsets of CCS
– Christensen, Hirshfeld, et al.
- 1994
|
|
10
|
Model checking PA-processes
– Mayr
- 1997
|
|
8
|
The reachability problem for ground TRS and some extensions
– Deruyver, Gilleron
- 1989
|
|
7
|
A model for recursive-parallel programs
– Schnoebelen
- 1996
|
|
7
|
On the regular structure of prefix rewriting, Theoretical Computer Science 106
– Caucal
- 1992
|
|
5
|
A formal framework for the analysis of recursive-parallel programs
– Schnoebelen
- 1997
|
|
5
|
Combining petri nets and pa-processes
– Mayr
- 1997
|
|
3
|
Tableaux methods for PA-processes
– Mayr
- 1997
|
|
2
|
More in results
– Burkart, Esparza
- 1996
|
|
2
|
More innite results
– Burkart, Esparza
- 1997
|
|
2
|
Regular canonical systems
– Bchi
- 1964
|
|
2
|
On the regular structure of pre��x rewriting, Theoret
– Caucal
- 1992
|
|
1
|
On the regular structure of pre rewriting. Theoretical Computer Science
– Caucal
- 1992
|
|
1
|
Verifying in��nite state processes with sequential and parallel composition
– Bouajjani, Echahed, et al.
- 1995
|
|
1
|
Deciding bisimulation-like equivalences with ��nitestate processes
– Janar, Kuera, et al.
- 1998
|
|
1
|
Regularity is decidable for normed PA processes in polynomial time
– Kuera
- 1996
|
|
1
|
How to parallelize sequential processes
– Kuera
- 1997
|
|
