Axiomatizations for the Perpetual Loop in Process Algebra

Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this paper, Milner's axioms are adapted to no-exit iteration x w , which executes x infinitely many times in a row, and it is shown that this axiomatization is complete for no-exit iteration in basic process algebra with deadlock and empty process, modulo bisimulation.

[1]  Luca Aceto,et al.  An Equational Axiomatization for Multi-Exit Iteration , 1996, Inf. Comput..

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

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

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

[5]  Jan A. Bergstra,et al.  Verification of an alternating bit protocol by means of process algebra , 1985, Mathematical Methods of Specification and Synthesis of Software Systems.

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

[7]  Luca Aceto,et al.  A Menagerie of Non-Finitely Based Process Semantics over BPA*: From Ready Simulation Semantics to Completed Traces , 1996 .

[8]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

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

[10]  Jan A. Bergstra,et al.  Grid Protocols Based on Synchronous Communication , 1997, Sci. Comput. Program..

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

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

[13]  Jan A. Bergstra,et al.  The Discrete Time TOOLBUS , 1996, AMAST.

[14]  Jan A. Bergstra,et al.  Decidability of bisimulation equivalence for process generating context-free languages , 1987, JACM.

[15]  Luca Aceto,et al.  Axiomatizing Prefix Iteration with Silent Steps , 1995, Inf. Comput..

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

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

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

[19]  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.

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

[21]  Jan A. Bergstra,et al.  Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages , 1987, PARLE.

[22]  Jos C. M. Baeten,et al.  A Congruence Theorem for Structured Operational Semantics with Predicates , 1993, CONCUR.

[23]  Wan Fokkink,et al.  Ntyft/Ntyxt Rules Reduce to Ntree Rules , 1996, Inf. Comput..