Strong Priority and Determinacy in Timed CCS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2023

Strong Priority and Determinacy in Timed CCS

Abstract

Building on the classical theory of process algebra with priorities, we identify a new scheduling mechanism, called "sequentially constructive reduction" which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinism-by-construction for multi-cast concurrent communication. In particular, it permits us to model shared memory multi-threading with reaction to absence as it lies at the core of the programming language Esterel. In the technical setting of Milner's CCS extended by clocks and priorities, we prove for a large class of processes, which we call "structurally coherent" the confluence property for constructive reductions. We further show that under some syntactic restrictions, called "pivotable" the operators of prefix, summation, parallel composition, restriction and hiding preserve structural coherence. This covers a strictly larger class of processes compared to those that are confluent in Milner's classical theory of CCS without priorities.
Fichier principal
Vignette du fichier
synpatick-lipics.pdf (1.78 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04367635 , version 1 (21-02-2024)

Licence

Attribution

Identifiers

  • HAL Id : hal-04367635 , version 1

Cite

Luigi Liquori, Michael Mendler. Strong Priority and Determinacy in Timed CCS. Inria; University of Bamberg. 2023. ⟨hal-04367635⟩
51 View
6 Download

Share

Gmail Facebook X LinkedIn More