96

Decidability of bisimulation equivalence for processes generating contextfree languages
– J C M Baeten, J A Bergstra, J W Klop
 1993

3219

Communication and Concurrency
– R Milner
 1990

45

Actions Speak Louder than Words: Proving Bisimilarity for ContextFree Processes
– Hans Hüttel, Colin Stirling
 1991

83

Decidability and decomposition in process algebras
– S Christensen
 1983

3843

Introduction to Automata Theory, Languages, and Computation (2nd Edition
– R M J E Hopcroft, J Ullman
 2000

19

Decidability Questions for Bisimilarity of Petri Nets and Some Related Problems
– Petr Jancar
 1994

33

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

364

Process algebra for synchronous communication
– J. A. Bergstra, J. W. Klop
 1984

20

F.: Bisimulation is decidable for all basic parallel processes
– S Christensen, Y Hirshfeld, Moller
 1993

23

A short proof of the decidability of bisimulation for normed BPA processes
– J F Groote
 1992

163

An algorithm for the general petri net reachability problem
– E W Mayr
 1981

37

Simple deterministic languages
– A J Korenjak, J E Hopcroft
 1966

53

F.: Bisimulation equivalence is decidable for basic parallel processes
– S Christensen, Y Hirshfeld, Moller
 1993

39

Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
– S Christensen, Y Hirshfeld, F Moller
 1993

290

The Linear TimeBranching Time Spectrum II  The semantics of sequential systems with silent moves
– R.J. van Glabbeek
 1993

658

Concurrency and automata on infinite sequences
– D Park
 1981

25

Petri nets and the equivalence problem
– Y Hirshfeld
 1993

16

Graphes canoniques de graphes algébriques
– D Caucal
 1990
