A Complete Proof System for 1-Free Regular Expressions Modulo Bisimilarity

Robin Milner (1984) gave a sound proof system for bisimilarity of regular expressions interpreted as processes: Basic Process Algebra with unary Kleene star iteration, deadlock 0, successful termination 1, and a fixed-point rule. He asked whether this system is complete. Despite intensive research over the last 35 years, the problem is still open. This paper gives a partial positive answer to Milner's problem. We prove that the adaptation of Milner's system over the subclass of regular expressions that arises by dropping the constant 1, and by changing to binary Kleene star iteration is complete. The crucial tool we use is a graph structure property that guarantees expressibility of a process graph by a regular expression, and that is preserved when going over from a process graph to its bisimulation collapse.

[1]  Hans Zantema,et al.  Basic Process Algebra with Iteration: Completeness of its Equational Axioms , 1993, Comput. J..

[2]  Douglas R. Troeger.  Step bisimulation is pomset equivalence on a parallel language without explicit internal choice , 1993, Mathematical Structures in Computer Science.

[3]  Ken Thompson,et al.  Programming Techniques: Regular expression search algorithm , 1968, Commun. ACM.

[4]  W. J. Fokkink,et al.  An Axiomatization for the Terminal Cycle , 1996 .

[5]  Arto Salomaa.  ALGEBRA OF REGULAR EXPRESSIONS , 1969 .

[6]  Clemens Grabmayer,et al.  Using Proofs by Coinduction to Find "Traditional" Proofs , 2005, CALCO.

[7]  Daniel Krob,et al.  Complete Systems of B-Rational Identities , 1991, Theor. Comput. Sci..

[8]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

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

[10]  Jan J. M. M. Rutten,et al.  A coinductive calculus of streams , 2005, Mathematical Structures in Computer Science.

[11]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[12]  David Park,et al.  Concurrency and Automata on Infinite Sequences , 1981, Theoretical Computer Science.

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

[14]  A. N. Prior,et al.  Equational logic , 1968, Notre Dame J. Formal Log..

[15]  Jan A. Bergstra,et al.  Process Algebra with Iteration and Nesting , 1994, Comput. J..

[16]  Peter Sewell,et al.  Nonaxiomatisability of Equivalences over Finite State Processes , 1997, Ann. Pure Appl. Log..

[17]  Clemens Grabmayer,et al.  Maximal sharing in the Lambda calculus with letrec , 2014, ICFP.

[18]  Clemens Grabmayer.  Modeling Terms by Graphs with Structure Constraints (Two Illustrations) , 2018, TERMGRAPH@FSCD.

[19]  Jos L. M. Vrancken,et al.  The Algebra of Communicating Processes With Empty Process , 1997, Theor. Comput. Sci..

[20]  Clemens Grabmayer,et al.  Term Graph Representations for Cyclic Lambda-Terms , 2013, TERMGRAPH.

[21]  Rocco De Nicola,et al.  An Equational Axiomatization of Bisimulation over Regular Expressions , 2002, J. Log. Comput..

[22]  Wan Fokkink,et al.  On the Completeness of the Euations for the Kleene Star in Bisimulation , 1995, AMAST.

[23]  Wan Fokkink,et al.  Axiomatizations for the Perpetual Loop in Process Algebra , 1997, ICALP.

[24]  Peter Sewell.  Bisimulation is not finitely (first order) equationally axiomatisable , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[25]  Jos C. M. Baeten,et al.  A characterization of regular expressions under bisimulation , 2007, JACM.

[26]  Jan A. Bergstra,et al.  Process Algebra with Recursive Operations , 2001, Handbook of Process Algebra.

[27]  Bell Telephone,et al.  Regular Expression Search Algorithm , 1968 .

[28]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[29]  D.J.B. Bosscher,et al.  Grammars modulo bisimulation , 1997 .