Determinacy with Priorities up to Clocks

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liquori, Luigi, Mendler, Michael, Stolze, Claude
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866913015650058240
author Liquori, Luigi
Mendler, Michael
Stolze, Claude
author_facet Liquori, Luigi
Mendler, Michael
Stolze, Claude
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2604_06879
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Determinacy with Priorities up to Clocks
Liquori, Luigi
Mendler, Michael
Stolze, Claude
Programming Languages
Distributed, Parallel, and Cluster Computing
Software Engineering
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.
title Determinacy with Priorities up to Clocks
topic Programming Languages
Distributed, Parallel, and Cluster Computing
Software Engineering
url https://arxiv.org/abs/2604.06879