Action Structures

Action structures are proposed as a variety of algebra to underlie concrete models of concurrency and interaction. An action structure is equipped with composition and product of actions, together with two other ingredients: an indexed family of abstractors to allow parametrisation of actions, and a reaction relation to represent activity. The eight axioms of an action structure make it an enriched strict monoidal category; however, the work is presented algebraically rather than in category theory. The notion of action structure is developed mathematically, and examples are studied ranging from the evaluation of expressions to the statics and dynamics of Petri nets. For algebraic process calculi in particular, it is shown how they may be defined by a uniform superposition of process structure upon an action structure specific to each calculus. This allows a common treatment of bisimulation congruence. The theory of action structures emphasizes the notion of effect; that is, the effect which any interaction among processes exerts upon its participants. Effects are degenerate actions, and constitute a sub-actionstructure with special properties which support the general treatment of bisimulation. Other current work on action structures is outlined, in particular their use for the -calculus. Challenges are posed for the algebraic theory, including the study of combinations of action structures. Action structures are briefly compared with some other general models. This work was done with the support of a Senior Fellowship from the Science and Engineering Research Council, UK.

[1]  G. M. Kelly,et al.  Categories of continuous functors, I , 1972 .

[2]  James L. Peterson,et al.  Petri Nets , 1977, CSUR.

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

[4]  Glynn Winskel,et al.  Petri Nets, Event Structures and Domains , 1979, Semantics of Concurrent Computation.

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

[6]  M. Barr,et al.  Toposes, Triples and Theories , 1984 .

[7]  Glynn Winskel,et al.  Petri Nets, Algebras, Morphisms, and Compositionality , 1987, Inf. Comput..

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

[9]  Ursula Goltz,et al.  Equivalence Notions for Concurrent Systems and Refinement of Actions (Extended Abstract) , 1989, MFCS.

[10]  Gérard Berry,et al.  The chemical abstract machine , 1989, POPL '90.

[11]  José Meseguer,et al.  Petri Nets Are Monoids , 1990, Inf. Comput..

[12]  Raymond R. Devillers,et al.  The box calculus: a new causal algebra with multi-label communication , 1992, Advances in Petri Nets: The DEMON Project.

[13]  Luca Aceto,et al.  Towards Action-Refinement in Process Algebras , 1993, Inf. Comput..