@inproceedings{74122e1f7696489d82f039a3216fbbee,
title = "Bisimulation equivalence is decidable for basic parallel processes",
abstract = "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.",
author = "S{\o}ren Christensen and Yoram Hirshfeld and Faron Moller",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1993.; null ; Conference date: 23-08-1993 Through 26-08-1993",
year = "1993",
doi = "10.1007/3-540-57208-2_11",
language = "אנגלית",
isbn = "9783540572084",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "143--157",
editor = "Eike Best",
booktitle = "CONCUR 1993 - 4th International Conference on Concurrency Theory, Proceedings",
}