核心概念
The authors introduce a new scheduling mechanism, constructively reducing determinism for multi-cast concurrent communication in Timed CCS. They combine clocks and priorities to reconcile non-determinism with functional reactions.
摘要
The content discusses the integration of clocks and priorities in Timed CCS to achieve determinism for shared memory multi-threading. It explores the confluence property for constructive reductions and syntactic restrictions preserving structural coherence.
Classical process algebras are contrasted with automata theory, emphasizing synchronous programming's success in hardware design. The paper proposes precedence policies as a refinement of existing priority schemes for achieving determinism.
Key points include examples illustrating scheduling semantics, coherence, policy-coherent processes, and constructive enabling. The concept of policy-coherence leads to structurally deterministic processes under clock transitions.
The discussion extends to Esterel signals, ABRO behavior modeling, and the application of constructive scheduling in CCSspt. Theoretical propositions highlight the importance of interference-free c-actions and coherence for confluence.
統計資料
Inria, France
University of Bamberg, Germany
2012 ACM Subject Classification Theory of computation, Process algebras
Digital Object Identifier 10.4230/LIPIcs...
Partially funded by ETSI.
Partially funded by UniCA/I3S.