@inproceedings{fb9aa2d083044181b14f3f9230a61b3b,
title = "Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes",
abstract = "We prove the decidability of two subclasses of recursive processes involving a parallel composition operator with respect to bisimulation equivalence, namely the so-called normed and live processes. To accomplish this, we first prove a unique decomposition result for (a generalization of) normed processes, in order to deduce a necessary cancellation law. The decidability proof permits us further to present a complete axiomatization for these process classes.",
author = "Soren Christensen and Yoram Hirshfeld and Faron Moller",
year = "1993",
language = "אנגלית",
isbn = "0818631422",
series = "Proceedings - Symposium on Logic in Computer Science",
publisher = "Publ by IEEE",
pages = "386--396",
booktitle = "Logic in Computer Science",
note = "Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science ; Conference date: 19-06-1993 Through 23-06-1993",
}