A Ground-Complete Axiomatization of Finite State Processes in Process Algebra
We consider a generic process algebra of which the standard process algebras ACP, CCS and CSP are subalgebras of reduced expressions. In particular such an algebra is endowed with a recursion operator which computes minimal fixpoint solutions of systems of equations over processes. As model for processes we consider finite-state transition systems modulo Milner‘s observational congruence and we define an operational semantics for the process algebra. Over such a generic algebra we show the following. We provide a syntactical characterization (allowing as many terms as possible) for the equations involved in recursion operators, which guarantees that transition systems generated by the operational semantics are indeed finite-state. Vice-versa we show that every process admits a specification in terms of such a restricted form of recursion. We then present an axiomatization which is ground-complete over such a restricted signature: an equation can be derived from the axioms between closed terms exactly when the corresponding finite-state transition systems are observationally congruent. Notably, in presenting such an axiomatization, we also show that the two standard axioms of Milner for weakly unguarded recursion can be expressed by using just a single axiom.
KeywordsNormal Form Transition System Operational Semantic Parallel Composition Process Algebra
Unable to display preview. Download preview PDF.
- 2.Baeten, J.C.M., Basten, T., Reniers, M.A.: Algebra of Communicating Processes. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge (2005)Google Scholar
- 4.Baeten, J.C.M., Bergstra, J.A., Hoare, C.A.R., Milner, R., Parrow, J., de Simone, R.: The variety of process algebra. Deliverable ESPRIT Basic Research Action 3006, CONCUR (1991) Google Scholar
- 5.Baeten, J.C.M., Bravetti, M.: A ground-complete axiomatization of finite state processes in process algebra. Technical Report CS Report 05-18, Technische Universiteit Eindhoven, Department of Mathematics and Computer Science (2005) Google Scholar
- 6.Bergstra, J.A., Klop, J.W.: Verification of an alternating bit protocol by means of process algebra. In: Bibel, W., Jantke, K.P. (eds.) Mathematical Methods of Specification and Synthesis of Software Systems 1985. LNCS, vol. 215, pp. 9–23. Springer, Heidelberg (1986)Google Scholar
- 8.Bergstra, J.A., Klop, J.W.: A complete inference system for regular processes with silent moves. In: Drake, F.R., Truss, J.K. (eds.) Proc. Logic Colloquium 1986, pp. 21–81. North-Holland, Amsterdam (1988)Google Scholar
- 12.van Glabbeek, R.J.: A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M., Sokolowski, S. (eds.) MFCS 1993. LNCS, vol. 711, pp. 473–484. Springer, Heidelberg (1993)Google Scholar
- 13.van Glabbeek, R.J.: On the expressiveness of ACP (extended abstract). In: Ponse, A., Verhoef, C., van Vlijmen, S.F.M. (eds.) Proceedings First Workshop on the Algebra of Communicating Processes, ACP 1994, Utrecht, The Netherlands, May 1994, Workshops in Computing, pp. 188–217 (1994), available at http://boole.stanford.edu/pub/acp.ps.gz
- 18.Vaandrager, F.W.: Verification of two communication protocols by means of process algebra. Technical Report report CS-R8608, CWI Amsterdam (1986)Google Scholar