Download:
|
by Yoram Hirshfeld, Mark Jerrum, Faron Moller
ftp://ftp.sics.se/pub/SICS-reports/Reports/SICS-R--94-09--SE.ps.Z
Add To MetaCart
Abstract:
equivalence
Citations
|
2961
|
Introduction to automata theory, languages and computation
– Hopcroft, Ullman
- 1979
|
|
2860
|
Communication and Concurrency
– Milner
- 1989
|
|
564
|
Concurrency and automata on infinite sequences
– Park
- 1981
|
|
103
|
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
– Baeten, Bergstra, et al.
- 1993
|
|
97
|
Bisimulation Equivalence is Decidable for all Context-Free Processes
– Christensen, Huttel, et al.
- 1995
|
|
51
|
Bisimulation equivalence is decidable for basic parallel processes
– Christensen, Hirshfeld, et al.
- 1993
|
|
45
|
Actions speak louder than words: Proving bisimilarity for context-free processes
– Huttel, Stirling
- 1991
|
|
37
|
Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes
– Christensen, Hirshfeld, et al.
- 1993
|
|
37
|
A polynomial algorithm for deciding bisimilarity of normed context-free processes
– Hirshfeld, Jerrum, et al.
- 1996
|
|
22
|
Unique decomposition of processes
– Milner, Moller
- 1993
|
|
21
|
A short proof of the decidability of bisimulation for normed BPA processes
– Groote
- 1991
|
|
9
|
Deciding bisimilarity of normed context-free processes is
– Huynh, Tian
- 1994
|
|
2
|
nets and the equivalence problem. To appear
– Hirshfeld, Petri
|
