Hostname: page-component-cd9895bd7-q99xh Total loading time: 0 Render date: 2024-12-29T14:19:55.973Z Has data issue: false hasContentIssue false
  • English
  • Français

A ground-complete axiomatisation of finite-state processes in a generic process algebra

Published online by Cambridge University Press:  01 December 2008

JOS C. M. BAETEN  and
MARIO BRAVETTI
JOS C. M. BAETEN
Affiliation:
Division of Computer Science, Technische Universiteit Eindhoven, The Netherlands Email: josb@win.tue.nl
MARIO BRAVETTI
Affiliation:
Department of Computer Science, Università di Bologna, Italy Email: bravetti@cs.unibo.it
Get access Rights & Permissions [Opens in a new window]

Abstract

The three classical process algebras CCS, CSP and ACP present several differences in their respective technical machinery. This is due, not only to the difference in their operators, but also to the terminology and ‘way of thinking’ of the community that has been (and still is) working with them. In this paper we will first discuss these differences and try to clarify the different usage of terminology and concepts. Then, as a result of this discussion, we define a generic process algebra where each of the basic mechanisms of the three process algebras (including minimal fixpoint based unguarded recursion) is expressed by an operator, and which can be used as an underlying common language. We show an example of the advantages of adopting such a language instead of one of the three more specialised algebras: producing a complete axiomatisation for Milner's observational congruence in the presence of (unguarded) recursion and static operators. More precisely, we provide a syntactical characterisation (allowing as many terms as possible) for the equations involved in recursion operators, which guarantees that transition systems generated by the operational semantics are finite state. Conversely, we show that every process admits a specification in terms of such a restricted form of recursion. We then present an axiomatisation that is ground complete over such a restricted signature. Notably, we also show that the two standard axioms of Milner for weakly unguarded recursion can be expressed using a single axiom only.

Type
Paper
Information
Mathematical Structures in Computer Science , Volume 18 , Issue 6 , December 2008 , pp. 1057 - 1089
Copyright
Copyright © Cambridge University Press 2008

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Baeten, J.C.M. (2003) Embedding untimed into timed process algebra: The case for explicit termination. Mathematical Structures in Computer Science 13 (4)589–618.CrossRefGoogle Scholar
Baeten, J.C.M., Basten, T. and Reniers, M.A. (2008) Process algebra (equational theories of communicating processes), Cambridge Tracts in Theoretical Computer Science, Cambridge University Press.Google Scholar
Baeten, J.C.M. and Bergstra, J.A. (1997) Process algebra with propositional signals. Theoretical Computer Science 177 (2)381–406.CrossRefGoogle Scholar
Baeten, J.C.M., Bergstra, J.A., Hoare, C.A.R., Milner, R., Parrow, J. and de Simone, R. (1991) The variety of process algebra. Deliverable ESPRIT Basic Research Action 3006, CONCUR.CrossRefGoogle Scholar
Baeten, J.C.M. and Bravetti, M. (2005) A ground-complete axiomatisation of finite state processes in process algebra. In: Abadi, M. and de Alfaro, L. (eds.) Proc. of the 16th International Conference on Concurrency Theory (CONCUR 2005). Springer-Verlag Lecture Notes in Computer Science 3653 248–262.CrossRefGoogle Scholar
Baeten, J.C.M. and Bravetti, M. (2006) A generic process algebra. In: Aceto, L. and Gordon, A.D. (eds.) Proc. of the Workshop Essays on Algebraic Process Calculi (APC 25). Electr. Notes Theor. Comput. Sci. 162 65–71.CrossRefGoogle Scholar
Baeten, J.C.M. and van Glabbeek, R.J. (1987) Merge and termination in process algebra. In: Nori, K.V. (ed.) Proc. 7th Conf. on Foundations of Software Technology and Theoretical Computer Science, Pune, India. Springer-Verlag Lecture Notes in Computer Science 287 153–172.CrossRefGoogle Scholar
Bergstra, J.A. and Klop, J.W. (1984) Process algebra for synchronous communication. Information and Control 60 (1/3)109–137.CrossRefGoogle Scholar
Bergstra, J.A. and Klop, J.W. (1985) Algebra of communicating processes with abstraction. Theoretical Computer Science 37 (1)77–121.CrossRefGoogle Scholar
Bergstra, J.A. and Klop, J.W. (1986) Verification of an alternating bit protocol by means of process algebra. In: Bibel, W. and Jantke, K.P. (eds.) Proc. Mathematical Methods of Specification and Synthesis of Software Systems. Springer-Verlag Lecture Notes in Computer Science 215 9–23.CrossRefGoogle Scholar
Bergstra, J.A. and Klop, J.W. (1988) A complete inference system for regular processes with silent moves. In: Drake, F.R. and Truss, J.K. (eds.) Proc. Logic Colloquium'86, North-Holland21–81.Google Scholar
Bravetti, M. and Gorrieri, R. (2002) Deciding and axiomatizing weak ST bisimulation for a process algebra with recursion and action refinement. ACM Transactions on Computational Logic 3 (4)465–520.CrossRefGoogle Scholar
Brookes, S.D., Hoare, C.A.R. and Roscoe, A.W. (1984) A theory of communicating sequential processes. Journal of the ACM 31 (3)560–599.CrossRefGoogle Scholar
van Glabbeek, R.J. (1987) Bounded nondeterminism and the approximation induction principle in process algebra. In: Brandenburg, F.J., Vidal-Naquet, G. and Wirsing, M. (eds.) Proceedings STACS'87. Springer-Verlag Lecture Notes in Computer Science 247 336–347.CrossRefGoogle Scholar
van Glabbeek, R.J. (1993) A complete axiomatization for branching bisimulation congruence of finite-state behaviours. In: Borzyszkowski, A.M. and Sokolowski, S. (eds.) Proc. MFCS'93. Springer-Verlag Lecture Notes in Computer Science 711 473–484.CrossRefGoogle Scholar
van Glabbeek, R.J. (1994) On the expressiveness of ACP (extended abstract). In: Ponse, A., Verhoef, C. and van Vlijmen, S.F.M. (eds.) Proceedings First Workshop on the Algebra of Communicating Processes, ACP94, Workshops in Computing, Springer-Verlag 188–217. (Available at http://boole.stanford.edu/pub/acp.ps.gz)Google Scholar
van Glabbeek, R.J. (1997) Notes on the methodology of CCS and CSP. Theoretical Computer Science 177 (6)329–349.CrossRefGoogle Scholar
vanGlabbeek, R.J. Glabbeek, R.J. and Weijland, W.P. (1996) Branching time and abstraction in bisimulation semantics. Journal of the ACM 43 (3)555–600.Google Scholar
Hoare, C.A.R. (1985) Communicating Sequential Processes, Prentice Hall.Google Scholar
Milner, R. (1989a) Communication and Concurrency, Prentice Hall.Google Scholar
Milner, R. (1989b) A complete axiomatization for observational congruence of finite-state behaviours. Information and Computation 81 227–247.CrossRefGoogle Scholar
Sangiorgi, D. and Milner, R. (1992) The problem of ‘weak bisimulation up to’. In: Cleaveland, R. (ed.) Proceedings CONCUR'92. Springer-Verlag Lecture Notes in Computer Science 630 32–46.CrossRefGoogle Scholar
Vaandrager, F.W. (1986) Verification of two communication protocols by means of process algebra. Technical Report report CS-R8608, CWI Amsterdam, 1986.Google Scholar