Advertisement

A Ground-Complete Axiomatization of Finite State Processes in Process Algebra

  • Jos C. M. Baeten
  • Mario Bravetti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3653)

Abstract

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.

Keywords

Normal Form Transition System Operational Semantic Parallel Composition Process Algebra 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baeten, J.C.M.: Embedding untimed into timed process algebra: The case for explicit termination. Mathematical Structures in Computer Science 13(4), 589–618 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 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
  3. 3.
    Baeten, J.C.M., Bergstra, J.A.: Process algebra with propositional signals. Theoretical Computer Science 177(2), 381–406 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 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. 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. 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
  7. 7.
    Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science 37(1), 77–121 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 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
  9. 9.
    Bravetti, M., Gorrieri, R.: Deciding and axiomatizing weak st bisimulation for a process algebra with recursion and action refinement. ACM Transactions on Computational Logic 3(4), 465–520 (2002)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Brookes, S.D.: On the relationship of CCS and CSP. In: Díaz, J. (ed.) ICALP 1983. LNCS, vol. 154, pp. 83–96. Springer, Heidelberg (1983)CrossRefGoogle Scholar
  11. 11.
    van Glabbeek, R.J.: Bounded nondeterminism and the approximation induction principle in process algebra. In: Brandenburg, F.J., Vidal-Naquet, G., Wirsing, M. (eds.) STACS 1987. LNCS, vol. 247, pp. 336–347. Springer, Heidelberg (1987)CrossRefGoogle Scholar
  12. 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. 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
  14. 14.
    van Glabbeek, R.J.: Notes on the methodology of CCS and CSP. Theoretical Computer Science 177(6), 329–349 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  16. 16.
    Milner, R.: A complete inference system for a class of regular behaviours. Journal of Comput. System Sci. 28(3), 439–466 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Milner, R.: Communication and Concurrency. Prentice Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  18. 18.
    Vaandrager, F.W.: Verification of two communication protocols by means of process algebra. Technical Report report CS-R8608, CWI Amsterdam (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Jos C. M. Baeten
    • 1
  • Mario Bravetti
    • 2
  1. 1.Division of Computer ScienceTechnische Universiteit Eindhoven 
  2. 2.Department of Computer ScienceUniversità di Bologna 

Personalised recommendations