The Theory of Sequential Processes includes deadlock, successful termination, action prefixing, alternative and sequential composition. Intermediate acceptance, which is important for the integration of classical automata theory, can be expressed through a combination of alternative composition and successful termination. Recently, it was argued that complications arising from the interplay between intermediate acceptance and sequential composition can be eliminated by replacing sequential composition by sequencing. In this paper we study the equational theory of the recursion-free fragment of the resulting process theory modulo bisimilarity, proving that it is not finitely based, but does afford a ground-complete axiomatisation if a unary auxiliary operator is added. Furthermore, we prove that bisimilarity is decidable for processes definable by means of a finite guarded recursive specification over the process theory.

Additional Metadata
Keywords Sequencing, Sequential composition, Bisimilarity, Axiomatisation, Decidability
Persistent URL dx.doi.org/10.4230/LIPIcs.CALCO.2019.14
Series Leibniz International Proceedings in Informatics
Citation
Belder, A, Luttik, S.P, & Baeten, J.C.M. (2019). Sequencing and intermediate acceptance: Axiomatisation and decidability of bisimilarity. In Proceedings of the 8th Conference on Algebra and Coalgebra in Computer Science (pp. 14:1–14:22). doi:10.4230/LIPIcs.CALCO.2019.14