Abstract In an algebraic setting for parallelism and synchronisation due to R. Milner, we define a wide variety of synchronising operators on processes. We introduce them by the semantical conditional rules they obey. We prove they are higher-level nonprimitive operators from the original SCCS calculus, showing how to meet their behaviours with primitive expressions. Our purposes are: study of expressiveness—either ‘semantic’, in the realm of transition systems, or ‘syntaxic’, through translation of other formalisms in the calculus. Such operators allow one to specify formally sophisticated synchronisation modes dealing with (operational) products and transformations of transition systems, and still not lose their informal appealing intuition; for we then forget the realisation working with Meije -SCCS elementary synchronisation mechanisms (the mechanics below the hood). The defining rules are syntactically given, except for the allowed relations on the components' actions monoids. This ‘semantical’ aspect allows us to treat many ‘calculability’ issues. This is especially true of closed terms, where we may claim constructive ‘universality’ amongst transition systems. The case of operators seems slightly more intricate. The proof of our main result has led us to a technical shaping of equivalence proofs for open expressions which shows to be interesting in its own right.
[1]
Gérard Boudol,et al.
Algèbre de Processus et Synchronisation
,
1984,
Theor. Comput. Sci..
[2]
G. Boudol,et al.
Notes on Algebraic Calculi of Processes
,
1989,
Logics and Models of Concurrent Systems.
[3]
Robert de Simone,et al.
On Meije and SCCS: Infinite Sum Operators VS. Non-Guarded Definitions
,
1984,
Theor. Comput. Sci..
[4]
Rohit Parikh,et al.
On Context-Free Languages
,
1966,
JACM.
[5]
Jan A. Bergstra,et al.
Process algebra semantics for queues
,
1983
.
[6]
Robin Milner,et al.
A Complete Inference System for a Class of Regular Behaviours
,
1984,
J. Comput. Syst. Sci..
[7]
Robin Milner,et al.
Calculi for Synchrony and Asynchrony
,
1983,
Theor. Comput. Sci..
[8]
Robin Milner,et al.
Flowgraphs and Flow Algebras
,
1979,
JACM.
[9]
Matthew Hennessy.
Proving systolic systems correct
,
1986,
TOPL.
[10]
C. C. Elgot.
Monadic Computation And Iterative Algebraic Theories
,
1982
.