Strong Priority and Determinacy in Timed CCS - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport Année : 2023

Strong Priority and Determinacy in Timed CCS

Résumé

Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called constructive reduction which is designed to capture the essence of synchronous programming. The distinctive property of this evaluation strategy is to achieve determinacy-by-construction for multi-cast concurrent communication with shared memory. In the technical setting of CCS extended by clocks and priorities, we prove for a large class of coherent processes a confluence property for constructive reductions. We show that under some restrictions, called pivotability, coherence is preserved by the operators of prefix, summation, parallel composition, restriction and hiding. Since this permits memory and sharing, we are able to cover a strictly larger class of processes compared to those in Milner’s classical confluence theory for CCS without priorities.
Fichier principal
Vignette du fichier
synpatick-lipics.pdf (1.79 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04367635 , version 1 (21-02-2024)
hal-04367635 , version 2 (29-04-2024)

Licence

Paternité

Identifiants

  • HAL Id : hal-04367635 , version 2

Citer

Luigi Liquori, Michael Mendler. Strong Priority and Determinacy in Timed CCS. Inria; University of Bamberg. 2023. ⟨hal-04367635v2⟩
60 Consultations
9 Téléchargements

Partager

Gmail Facebook X LinkedIn More