An ω-Complete Equational Specification of Interleaving
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not ω-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an ω- complete specification, which is finite in a setting with finitely many actions.
KeywordsInduction Hypothesis Binary Operation Sequential Composition Parallel Composition Atomic Action
Unable to display preview. Download preview PDF.
- Baeten, J. C. M. and Weijland, W. P. (1990). Process Algebra. Number 18 in Cambridge Tracts in Theoretical Computer Science. Cambridge University Press.Google Scholar
- Groote, J. F. (1990). A new strategy for proving ω-completeness applied to process algebra. In J. Baeten and J. Klop, editors, Proceedings of CONCUR’90, volume 458 of LNCS, pages 314–331, Amsterdam. Springer-Verlag.Google Scholar
- Hirshfeld, Y. and Jerrum, M. (1998). Bisimulation equivalence is decidable for normed process algebra. LFCS Report ECS-LFCS-98-386, University of Edinburgh.Google Scholar
- Hirshfeld, Y. and Jerrum, M. (1999). Bisimulation equivalence is decidable for normed process algebra. In J. Wiedermann, P. van Emde Boas, and M. Nielsen, editors, Proceedings of ICALP’99, volume 1644 of LNCS, pages 412–421, Prague. Springer.Google Scholar
- Moller, F. (1989). Axioms for Concurrency. Ph.D. thesis, University of Edinburgh.Google Scholar
- Moller, F. (1990). The importance of the left merge operator in process algebras. In M. Paterson, editor, Proceedings of ICALP’90, volume 443 of LNCS, pages 752–764, Warwick. Springer.Google Scholar