Finite Equational Bases in Process Algebra: Results and Open Questions

  • Luca Aceto
  • Wan Fokkink
  • Anna Ingolfsdottir
  • Bas Luttik
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3838)


Van Glabbeek (1990) presented the linear time/branching time spectrum of behavioral equivalences for finitely branching, concrete, sequential processes. He studied these semantics in the setting of the basic process algebra BCCSP, and tried to give finite complete axiomatizations for them. Obtaining such axiomatizations in concurrency theory often turns out to be difficult, even in the setting of simple languages like BCCSP. This has raised a host of open questions that have been the subject of intensive research in recent years. Most of these questions have been settled over BCCSP, either positively by giving a finite complete axiomatization, or negatively by proving that such an axiomatization does not exist. Still some open questions remain. This paper reports on these results, and on the state-of-the-art in axiomatizations for richer process algebras with constructs like sequential and parallel composition.


Operational Semantic Axiom System Parallel Composition Label Transition System 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aceto, L., Ésik, Z., Ingolfsdottir, A.: The max-plus algebra of the natural numbers has no finite equational basis. Theoretical Computer Science 293(1), 169–188 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Aceto, L., Fokkink, W.J., Ingolfsdottir, A.: A menagerie of non-finitely based process semantics over BPA*—from ready simulation to completed traces. Mathematical Structures in Computer Science 8(3), 193–230 (1998)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Aceto, L., Fokkink, W.J., Ingolfsdottir, A., Luttik, S.P.: CCS with Hennessy’s merge has no finite equational axiomatization. Theoretical Computer Science 330(3), 377–405 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Aceto, L., Fokkink, W.J., van Glabbeek, R.J., Ingolfsdottir, A.: Nested semantics over finite trees are equationally hard. Information and Computation 191(2), 203–232 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Baeten, J.C.M.: A brief history of process algebra. Theoretical Computer Science 335(2–3), 131–146 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Baeten, J.C.M., Weijland, W.P.: Process Algebra. In: Cambridge Tracts in Theoretical Computer Science, vol. 18. Cambridge University Press, Cambridge (1990)Google Scholar
  7. 7.
    Bergstra, J.A., Heering, J.: Which data types have omega-complete initial algebra specifications? Theoretical Computer Science 124(1), 149–168 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Bergstra, J.A., Klop, J.W.: Fixed point semantics in process algebras. Report IW 206, Mathematisch Centrum, Amsterdam (1982)Google Scholar
  9. 9.
    Bergstra, J.A., Klop, J.W.: The algebra of recursively defined processes and the algebra of regular processes. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 82–95. Springer, Heidelberg (1984)Google Scholar
  10. 10.
    Bergstra, J.A., Klop, J.W.: Process algebra for synchronous communication. Information and Control 60(1/3), 109–137 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science 37(1), 77–121 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Bergstra, J.A., Klop, J.W.: Algebra of communicating processes. In: de Bakker, J.W., Hazewinkel, M., Lenstra, J.K. (eds.) Mathematics and Computer Science. CWI Monograph, vol. 1, pp. 89–138. North-Holland, Amsterdam (1986)Google Scholar
  13. 13.
    Birkhoff, G.: On the structure of abstract algebras. In: Proceedings Cambridge Philosophical Society, vol. 31, pp. 433–454 (1935)Google Scholar
  14. 14.
    Blom, S.C.C., Fokkink, W.J., Nain, S.: On the axiomatizability of ready traces, ready simulation and failure traces. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 109–118. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  15. 15.
    Burris, S.N., Sankappanavar, H.P.: A Course in Universal Algebra. In: Graduate Texts in Mathematics. Springer, Heidelberg (1981), The Millennium Edition of this book is available at, Google Scholar
  16. 16.
    Conway, J.H.: Regular Algebra and Finite Machines. In: Brown, R., De Wet, J. (eds.) Mathematics Series. Chapman and Hall, Boca Raton (1971)Google Scholar
  17. 17.
    Ésik, Z., Okawa, S.: Series and parallel operations on pomsets. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol. 1738, pp. 316–328. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  18. 18.
    Fokkink, W.J.: Introduction to Process Algebra. In: Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (January 2000)Google Scholar
  19. 19.
    Fokkink, W.J., Luttik, S.P.: An omega-complete equational specification of interleaving. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 729–743. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  20. 20.
    Fokkink, W.J., Nain, S.: On finite alphabets and infinite bases: From ready pairs to possible worlds. In: Balet, O., Subsol, G., Torguet, P. (eds.) ICVS 2003. LNCS, vol. 2897, pp. 182–194. Springer, Heidelberg (2003)Google Scholar
  21. 21.
    Fokkink, W.J., Nain, S.: A finite basis for failure semantics. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 755–765. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  22. 22.
    Gischer, J.L.: The equational theory of pomsets. Theoretical Computer Science 61, 199–224 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  23. 23.
    van Glabbeek, R.J.: The linear time-branching time spectrum. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 278–297. Springer, Heidelberg (1990)Google Scholar
  24. 24.
    van Glabbeek, R.J.: The linear time-branching time spectrum I. The semantics of concrete, sequential processes. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, pp. 3–99. North-Holland, Amsterdam (2001)CrossRefGoogle Scholar
  25. 25.
    Groote, J.F.: A new strategy for proving ω-completeness with applications in process algebra. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 314–331. Springer, Heidelberg (1990)Google Scholar
  26. 26.
    Heering, J.: Partial evaluation and ω-completeness of algebraic specifications. Theoretical Computer Science 43(2-3), 149–167 (1986)zbMATHCrossRefMathSciNetGoogle Scholar
  27. 27.
    Hennessy, M.C.B.: Algebraic Theory of Processes. MIT Press, Cambridge (1988)zbMATHGoogle Scholar
  28. 28.
    Hennessy, M.C.B.: Axiomatising finite concurrent processes. SIAM Journal on Computing 17(5), 997–1017 (1988)zbMATHCrossRefMathSciNetGoogle Scholar
  29. 29.
    Hennessy, M.C.B., Milner, R.: Algebraic laws for nondeterminism and concurrency. Journal of the ACM 32(1), 137–161 (1985)zbMATHCrossRefMathSciNetGoogle Scholar
  30. 30.
    Hirshfeld, Y., Jerrum, M.: Bisimulation equivalence is decidable for normed process algebra. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 412–421. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  31. 31.
    Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)zbMATHGoogle Scholar
  32. 32.
    Keller, R.M.: Formal verification of parallel programs. Communications of the ACM 19(7), 371–384 (1976)zbMATHCrossRefGoogle Scholar
  33. 33.
    Kleene, S.C.: Representation of events in nerve nets and finite automata. In: Shannon, C.E., McCarthy, J. (eds.) Automata Studies, pp. 3–41. Princeton University Press, Princeton (1956)Google Scholar
  34. 34.
    Lin, H.: An interactive proof tool for process algebras. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 617–618. Springer, Heidelberg (1992)Google Scholar
  35. 35.
    Milner, R.: A complete inference system for a class of regular behaviours. Journal of Computer and System Sciences 28(3), 439–466 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  36. 36.
    Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  37. 37.
    Moller, F.: Axioms for Concurrency. PhD thesis, Department of Computer Science, University of Edinburgh, Report CST-59-89. Also published as ECS-LFCS-89-84 (July 1989)Google Scholar
  38. 38.
    Moller, F.: The importance of the left merge operator in process algebras. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 752–764. Springer, Heidelberg (1990)CrossRefGoogle Scholar
  39. 39.
    Moller, F.: The nonexistence of finite axiomatisations for CCS congruences. In: Proceedings 5th Symposium on Logic in Computer Science, Philadelphia, pp. 142–153. IEEE Computer Society Press, Los Alamitos (1990)CrossRefGoogle Scholar
  40. 40.
    Plotkin, G.D.: The λ-calculus is ω-incomplete. Journal of Symbolic Logic 39, 313–317 (1974)zbMATHCrossRefMathSciNetGoogle Scholar
  41. 41.
    Plotkin, G.D.: A structural approach to operational semantics. Report DAIMI FN-19, Computer Science Department, Aarhus University (1981)Google Scholar
  42. 42.
    Plotkin, G.D.: A structural approach to operational semantics. Journal of Logic and Algebraic Programming 60–61, 17–139 (2004); This is a revised version of the original DAIMI memo [41]MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Luca Aceto
    • 1
    • 4
  • Wan Fokkink
    • 2
    • 5
  • Anna Ingolfsdottir
    • 1
    • 4
  • Bas Luttik
    • 2
    • 3
  1. 1.BRICS (Basic Research in Computer Science), Centre of the Danish National Research Foundation, Department of Computer ScienceAalborg UniversityAalborg ØDenmark
  2. 2.Department of Software EngineeringCWIAmsterdamThe Netherlands
  3. 3.Department of Mathematics and Computer ScienceEindhoven Technical UniversityEindhovenThe Netherlands
  4. 4.Department of Computer ScienceReykjavík UniversityReykjavíkIceland
  5. 5.Department of Computer Science, Section Theoretical Computer ScienceVrije Universiteit AmsterdamAmsterdamThe Netherlands

Personalised recommendations