In Milner's seminal book on communication and concurrency introducing CCS, a process algebra inherently non-deterministic, chapter 11 was completely devoted to introduce the notion of determinacy and confluence in order to identify a subcalculus of CCS in which all definable agents are confluent.At the same time, or shortly later, determinate semantics were given for programming languages that reconcile concurrency and determinacy, such as Esterel by Berry and Gonthier, or SL by Boussinot and de Simone.These dedicated semantics do not easily map to Milner's confluence theory for CCS, which is unable to express causality and shared memory multi-threading with reaction to absence in a compositional way.We present an extension of CCS with priority-guarded actions and clocks, and we exploit the added expressiveness to enrich Milner's original notion of confluence by the new concept of coherence which permits us to encode, in a compositional fashion, synchronous programming languages such as Esterel.
Building similarity graph...
Analyzing shared references across papers
Loading...
Luigi Liquori
Michael Mendler
Claude Stolze
Electronic Proceedings in Theoretical Computer Science
Institut national de recherche en sciences et technologies du numérique
University of Bamberg
Building similarity graph...
Analyzing shared references across papers
Loading...
Liquori et al. (Tue,) studied this question.
www.synapsesocial.com/papers/69d895206c1944d70ce061ce — DOI: https://doi.org/10.4204/eptcs.444.8