References & Citations
Computer Science > Programming Languages
Title: Strong Priority and Determinacy in Timed CCS
(Submitted on 7 Mar 2024 (v1), last revised 2 May 2024 (this version, v3))
Abstract: 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.
Submission history
From: Luigi Liquori [view email][v1] Thu, 7 Mar 2024 16:02:31 GMT (1587kb,D)
[v2] Mon, 29 Apr 2024 12:24:11 GMT (1606kb,D)
[v3] Thu, 2 May 2024 15:45:37 GMT (1362kb,D)
Link back to: arXiv, form interface, contact.