TY - GEN
T1 - Bisimulation equivalence is decidable for basic parallel processes
AU - Christensen, Søren
AU - Hirshfeld, Yoram
AU - Moller, Faron
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - In a previous paper the authors proved the decidability of bisimulation equivalence over two subclasses of recursive processes involving a parallel composition operator, namely the so-called normed and live processes. In this paper, we extend this result to the whole class. The decidability proof permits us further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner's complete axiomatisation of bisimulation equivalence on regular processes.
AB - In a previous paper the authors proved the decidability of bisimulation equivalence over two subclasses of recursive processes involving a parallel composition operator, namely the so-called normed and live processes. In this paper, we extend this result to the whole class. The decidability proof permits us further to present a complete axiomatisation for this class of basic parallel processes. This result can be viewed as a proper extension of Milner's complete axiomatisation of bisimulation equivalence on regular processes.
UR - http://www.scopus.com/inward/record.url?scp=84974529145&partnerID=8YFLogxK
U2 - 10.1007/3-540-57208-2_11
DO - 10.1007/3-540-57208-2_11
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84974529145
SN - 9783540572084
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 143
EP - 157
BT - CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings
A2 - Best, Eike
PB - Springer Verlag
T2 - 4th International Conference on Concurrency Theory, CONCUR 1993
Y2 - 23 August 1993 through 26 August 1993
ER -