Finite Equational Bases in Process Algebra: Results and Open Questions

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.

[1]  Olivier Danvy,et al.  On the dynamic extent of delimited continuations , 2005, Inf. Process. Lett..

[2]  Wan Fokkink,et al.  Introduction to Process Algebra , 1999, Texts in Theoretical Computer Science. An EATCS Series.

[3]  R. J. vanGlabbeek.  The linear time - branching time spectrum , 1990 .

[4]  Jay L. Gischer,et al.  The Equational Theory of Pomsets , 1988, Theor. Comput. Sci..

[5]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[6]  Huimin Lin.  An Interactive Proof Tool for Process Algebras , 1992, STACS.

[7]  Gordon D. Plotkin,et al.  A structural approach to operational semantics , 2004, J. Log. Algebraic Methods Program..

[8]  Faron Moller,et al.  Axioms for concurrency , 1989 .

[9]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum I , 2001, Handbook of Process Algebra.

[10]  Olivier Danvy,et al.  An Operational Foundation for Delimited Continuations in the CPS Hierarchy , 2005, Log. Methods Comput. Sci..

[11]  Jan A. Bergstra,et al.  Algebra of Communicating Processes with Abstraction , 1985, Theor. Comput. Sci..

[12]  Matthew Hennessy,et al.  Axiomatising Finite Concurrent Processes , 1988, SIAM J. Comput..

[13]  Jan A. Bergstra,et al.  Algebra of Communicating Processes , 1995, Workshops in Computing.

[14]  Rob J. van Glabbeek,et al.  Branching time and abstraction in bisimulation semantics , 1996, JACM.

[15]  Luca Aceto,et al.  Nested Semantics over Finite Trees are Equationally Hard: Invited Talk , 2003, EXPRESS.

[16]  Wan Fokkink,et al.  On the Axiomatizability of Ready Traces, Ready Simulation, and Failure Traces , 2003, ICALP.

[17]  DanvyOlivier,et al.  A concrete framework for environment machines , 2007 .

[18]  Zoltán Ésik,et al.  Series and Parallel Operations on Pomsets , 1999, FSTTCS.

[19]  Wan Fokkink,et al.  A Finite Basis for Failure Semantics , 2005, ICALP.

[20]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[21]  G. Birkhoff,et al.  On the Structure of Abstract Algebras , 1935 .

[22]  Bas Luttik,et al.  An omega-Complete Equational Specification of Interleaving , 2000, ICALP.

[23]  O. Danvy,et al.  A Simple Proof of a Folklore Theorem about Delimited Control , 2005 .

[24]  Luca Aceto,et al.  The Max-Plus Algebra of the Natural Numbers has no Finite Equational Basis , 1999 .

[25]  Robin Milner,et al.  Algebraic laws for nondeterminism and concurrency , 1985, JACM.

[26]  Luca Aceto,et al.  The max-plus algebra of the natural numbers has no finite equational basis , 1999, Theor. Comput. Sci..

[27]  J. C. M. Baeten,et al.  Process Algebra: Bibliography , 1990 .

[28]  Ivan Damgård,et al.  Secure Computing, Economy, and Trust: A Generic Solution for Secure Auctions with Real-World Applications , 2005 .

[29]  Mark Jerrum,et al.  Bisimulation Equivanlence Is Decidable for Normed Process Algebra , 1999 .

[30]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[31]  J. Conway.  Regular algebra and finite machines , 1971 .

[32]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[33]  Olivier Danvy,et al.  Program Extraction From Proofs of Weak Head Normalization , 2005, MFPS.

[34]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[35]  Jos C. M. Baeten,et al.  A brief history of process algebra , 2005, Theor. Comput. Sci..

[36]  Robert M. Keller,et al.  Formal verification of parallel programs , 1976, CACM.

[37]  Ivan Damgård,et al.  A Quantum Cipher with Near Optimal Key-Recycling , 2005, CRYPTO.

[38]  Matthew Hennessy,et al.  Algebraic theory of processes , 1988, MIT Press series in the foundations of computing.

[39]  Jan A. Bergstra,et al.  Which Data Types have omega-complete Initial Algebra Specifications? , 1994, Theor. Comput. Sci..

[40]  R. V. Glabbeek.  CHAPTER 1 – The Linear Time - Branching Time Spectrum I.* The Semantics of Concrete, Sequential Processes , 2001 .

[41]  Faron Moller,et al.  The nonexistence of finite axiomatisations for CCS congruences , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[42]  Jan A. Bergstra,et al.  The Algebra of Recursively Defined Processes and the Algebra of Regular Processes , 1984, ICALP.

[43]  Wan Fokkink,et al.  On Finite Alphabets and Infinite Bases: From Ready Pairs to Possible Worlds , 2004, FoSSaCS.

[44]  Luca Aceto,et al.  A menagerie of non-finitely based process semantics over BPA* – from ready simulation to completed traces , 1998, Mathematical Structures in Computer Science.

[45]  Olivier Danvy,et al.  On obtaining the Boyer-Moore string-matching algorithm by partial evaluation , 2006, Inf. Process. Lett..

[46]  J Heering,et al.  Partial Evaluation and omega-Completeness of Algebraic Specifications , 1986, Theor. Comput. Sci..

[47]  Faron Moller.  The Importance of the Left Merge Operator in Process Algebras , 1990, ICALP.

[48]  Bas Luttik,et al.  CCS with Hennessy's merge has no finite-equational axiomatization , 2005, Theor. Comput. Sci..

[49]  Jan A. Bergstra,et al.  Process Algebra for Synchronous Communication , 1984, Inf. Control..

[50]  Luca Aceto,et al.  Nested Semantics over Finite Trees are Equationally Hard , 2003 .

[51]  J. Bergstra,et al.  Fixed point semantics in process algebras : (preprint) , 1982 .