Finite equational bases in process algebra: Results and open questions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3838 LNCS, Issue , 2005, Pages 338-367

  Aceto, Luca ^a,d   Fokkink, Wan ^b,e   Ingolfsdottir, Anna ^a,d   Luttik, Bas ^b,c  

^a DANISH NATIONAL RESEARCH FOUNDATION   (Denmark)

^b CWI   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^d REYKJAVIK UNIVERSITY   (Iceland)

^e VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; PROCESS DESIGN; SEMANTICS; SEQUENTIAL MACHINES;

AXIOMATIZATIONS; FINITE EQUATIONAL BASES; PROCESS ALGEBRA;

FINITE AUTOMATA;

EID: 33847123065     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11601548_18     Document Type: Article

References (42)

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