|
92
|
Decidability of bisimulation equivalence for processes generating context-free languages
– J C M Baeten, J A Bergstra, J W Klop
- 1993
|
|
2972
|
Communication and Concurrency
– R Milner
- 1989
|
|
43
|
Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes
– Hans Hüttel, Colin Stirling
- 1991
|
|
76
|
Decidability and Decomposition in Process Algebras
– S Christensen
- 1993
|
|
3377
|
Introduction to Automata Theory, Languages, and Computation
– J Hopcroft, J Ullman
- 1979
|
|
19
|
Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems
– Petr Jancar
- 1994
|
|
32
|
Undecidable Equivalences for Basic Process Algebra
– Jan Friso Groote, Hans Hüttel
- 1991
|
|
17
|
Bisimulation equivalence is decidable for all basic parallel processes
– S Christensen, Y Hirshfeld, F Moller
|
|
331
|
Process algebra for synchronous communication
– J. A. Bergstra, J. W. Klop
- 1984
|
|
19
|
Bisimulation is decidable for all basic parallel processes
– S Christensen, Y Hirshfeld, F Moller
- 1993
|
|
22
|
A short proof of the decidability of bisimulation for normed BPA processes
– J F Groote
- 1991
|
|
132
|
An algorithm for the general Petri net reachability problem
– E W Mayr
- 1984
|
|
34
|
Simple deterministic languages
– A J, J E HOPCROFT
|
|
50
|
Bisimulation equivalence is decidable for basic parallel processes
– S Christensen, Y Hirshfeld, F Moller
- 1993
|
|
39
|
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
– S Christensen, Y Hirshfeld, F Moller
- 1993
|
|
259
|
The Linear Time-Branching Time Spectrum II - The semantics of sequential systems with silent moves
– R.J. van Glabbeek
- 1993
|
|
599
|
Concurrency and automata on infinite sequences
– D Park
- 1981
|
|
24
|
Petri nets and the equivalence problem
– Y Hirshfeld
- 1994
|
|
14
|
Graphes canoniques de graphes algébriques
– D Caucal
- 1990
|
