Non-regular iterators in process algebra

We consider three forms of non-regular iteration in process algebra: the push-down operation $, de5ned by x $ y = x((x $ y)(x $ y)) + y, the nesting operation ), de5ned by x ) y = x((x ) y)x )+ y, and the back and forth operation � , de5ned by xy = x((xy)y )+ y. In the process algebraic framework ACP with abstraction and one of $, ) orwe provide de5nitions of the following standard processes: stack, context-free process, bag, and queue. These de5nitions apply to all standard behavioural equivalences (we only use x� = x, whereis the silent step). Moreover, these results yield the expressive power to express computable processes modulo rooted branching bisimulation equivalence, and hence support the equational founding of process algebra: standard processes can be represented as terms. c 2001 Elsevier Science B.V. All rights reserved.

[1]  Jan Friso Groote,et al.  A Complete Equational Axiomatization for MPA with String Iteration , 1995 .

[2]  Wan Fokkink,et al.  A Complete Axiomatization for Prefix Iteration in Branching Bisimulation , 1996, Fundam. Informaticae.

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

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

[5]  Jan Friso Groote,et al.  A Complete Equational Axiomatization for MPA with String Iteration , 1995, Theor. Comput. Sci..

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

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

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

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

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

[11]  Rob J. van Glabbeek,et al.  The Linear Time - Branching Time Spectrum II , 1993, CONCUR.

[12]  M. de Rijke,et al.  Modal Logic and Process Algebra , 1995 .

[13]  Rob J. van Glabbeek Axiomatizing Flat Iteration , 1997, CONCUR.

[14]  Luca Aceto,et al.  An Equational Axiomatization of Observation Congruence for Prefix Iteration , 1996, AMAST.

[15]  Jan A. Bergstra,et al.  On the Consistency of Koomen's Fair Abstraction Rule , 1987, Theor. Comput. Sci..

[16]  Jan A. Bergstra,et al.  Process algebra with iteration , 1993 .

[17]  Jan A. Bergstra,et al.  Top-Down Design and the Algebra of Communicating Processes , 1985, Sci. Comput. Program..

[18]  Jos C. M. Baeten,et al.  Another Look at Abstraction in Process Algebra (Extended Abstract) , 1987, ICALP.

[19]  Marc Bezem,et al.  Two Finite Specifications of a Queue , 1997, Theor. Comput. Sci..

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

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

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

[23]  Jan A. Bergstra,et al.  Global Renaming Operators in Concrete Process Algebra , 1988, Inf. Comput..

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

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

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

[27]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

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

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

[30]  FokkinkWan,et al.  A menagerie of non-finitely based process semantics over BPA* - from ready simulation to completed traces , 1998 .

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

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

[33]  Robin Milner,et al.  Calculi for Synchrony and Asynchrony , 1983, Theor. Comput. Sci..

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

[35]  Jan Friso Groote,et al.  A Modal Logic for CRL , 1994 .

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

[37]  Luca Aceto,et al.  A Coock's Tour of Equational Axiomatizations for Prefix Iteration , 1998 .

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

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

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

[41]  Robin Milner,et al.  A Modal Characterisation of Observable Machine-Behaviour , 1981, CAAP.

[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.  A Complete Equational Axiomatization for Prefix Iteration , 1994, Inf. Process. Lett..