Action systems, unbounded nondeterminism, and infinite traces

Morgan [Mor90a] has described a correspondence between Back's action systems [BKS83] and the conventionalfailures-divergences model of Hoare'scommunicating sequential processes (CSP) formalism [Hoa85]. However, the CSP failures-divergences model does not treat unbounded nondeterminism, although unbounded nondeterminism arises quite naturally in action systems; to that extent, the correspondence between the two approaches is inadequate.Fortunately there is an extendedinfinite traces model of CSP [RoB89] which treats unbounded nondeterminism. We extend the CSP-action system correspondence, using that model instead, to take the unbounded nondeterminism of action systems properly into account.In passing, we develop a definition of the weakest precondition under which an infinite heterogeneous trace of actions is enabled.

[1]  Jim Woodcock,et al.  Refinement of State-Based Concurrent Systems , 1990, VDM Europe.

[2]  Joseph M. Morris,et al.  A Theoretical Basis for Stepwise Refinement and the Programming Calculus , 1987, Sci. Comput. Program..

[3]  Ralph-Johan Back A Method for Refining Atomicity in Parallel Algorithms , 1989, PARLE.

[4]  Carroll Morgan,et al.  The Refinement Calculus , 1994, NATO ASI PDC.

[5]  Ralph-Johan Back,et al.  Refinement Calculus, Part II: Parallel and Reactive Programs , 1989, REX Workshop.

[6]  Mark B. Josephs A state-based approach to communicating processes , 2005, Distributed Computing.

[7]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

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

[9]  A. W. Roscoe,et al.  Unbounded Nondeterminism in CSP , 1989, Mathematical Foundations of Programming Semantics.

[10]  Robert Worden The Process of Refinement , 1991 .

[11]  W. H. J. Feijen,et al.  Beauty Is Our Business: A Birthday Salute to Edsger W.Dijkstra , 1990 .

[12]  Greg Nelson,et al.  A generalization of Dijkstra's calculus , 1989, ACM Trans. Program. Lang. Syst..

[13]  Carroll Morgan,et al.  Of wp and CSP , 1990 .

[14]  Carroll Morgan,et al.  The specification statement , 1988, TOPL.

[15]  Michael J. Butler A CSP approach to action systems , 1992 .

[16]  Ralph-Johan Back,et al.  Correctness preserving program refinements: Proof theory and applications , 1980 .

[17]  A. Tarski A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[18]  Ralph-Johan Back,et al.  Decentralization of Process Nets with Centralized Control , 1983, PODC.

[19]  A. W. Roscoe Unbounded Non-Determinism in CSP , 1993, J. Log. Comput..

[20]  Edsger W. Dijkstra,et al.  A Discipline of Programming , 1976 .

[21]  Michael Goldsmith,et al.  Programming in occam 2 , 1985, Prentice Hall international series in computer science.

[22]  Ralph-Johan Back Refinement Calculus, Lattices and Higher Order Logic , 1992, NATO ASI PDC.