Determinacy with Priorities up to Clocks

• URL: http://arxiv.org/abs/2604.06879v1
• Date: Wed, 08 Apr 2026 09:38:26 GMT
• Title: Determinacy with Priorities up to Clocks
• Abstract summary: CCS is unable to express causality and shared memory multi-threading with reaction to absence in a compositional way.<n>We exploit the added expressiveness to enrich Milner's original notion of confluence by the new concept of coherence.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Beyond Statistical Co-occurrence: Unlocking Intrinsic Semantics for Tabular Data Clustering [52.97486694817375]
  This paper proposes Tabular-Augmented Contrastive Clustering (TagCC) to bridge the gap between dataset-specific statistics and intrinsic semantic knowledge.<n>TagCC distills underlying data semantics into textual anchors via semantic-aware transformation.<n>It is jointly optimized with a clustering objective, ensuring that the learned representations are both semantically coherent and clustering-friendly.
  arXiv  Detail & Related papers  (2026-04-13T00:25:22Z)
• A Geometric Unification of Concept Learning with Concept Cones [58.70836885177496]
  Two traditions of interpretability have evolved side by side but seldom spoken to each other: Concept Bottleneck Models (CBMs) and Sparse Autoencoders (SAEs)<n>We show that both paradigms instantiate the same geometric structure.<n>CBMs provide human-defined reference geometries, while SAEs can be evaluated by how well their learned cones approximate or contain those of CBMs.
  arXiv  Detail & Related papers  (2025-12-08T09:51:46Z)
• LLM Probing with Contrastive Eigenproblems: Improving Understanding and Applicability of CCS [0.17188280334580197]
  We argue that what should be optimized for, is relative contrast consistency.<n>We reformulate CCS as an eigenproblem, yielding closed-form solutions with interpretable eigenvalues and natural extensions to multiple variables.<n>Our results suggest that relativizing contrast consistency not only improves our understanding of CCS but also opens pathways for broader probing and mechanistic interpretability methods.
  arXiv  Detail & Related papers  (2025-11-03T22:00:37Z)
• PICASO: Permutation-Invariant Context Composition with State Space Models [98.91198288025117]
  State Space Models (SSMs) offer a promising solution by allowing a database of contexts to be mapped onto fixed-dimensional states.<n>We propose a simple mathematical relation derived from SSM dynamics to compose multiple states into one that efficiently approximates the effect of concatenating raw context tokens.<n>We evaluate our resulting method on WikiText and MSMARCO in both zero-shot and fine-tuned settings, and show that we can match the strongest performing baseline while enjoying on average 5.4x speedup.
  arXiv  Detail & Related papers  (2025-02-24T19:48:00Z)
• NeSyCoCo: A Neuro-Symbolic Concept Composer for Compositional Generalization [17.49136753589057]
  NeSyCoCo is a neuro-symbolic framework that generates symbolic representations and maps them to differentiable neural computations.<n>Our framework achieves state-of-the-art results on the ReaSCAN and CLEVR-CoGenT compositional generalization benchmarks.
  arXiv  Detail & Related papers  (2024-12-20T05:48:58Z)
• Strong Priority and Determinacy in Timed CCS [0.0]
  Building on the standard theory of process algebra with priorities, we identify a new scheduling mechanism, called "constructive reduction"<n>We prove for a large class of "coherent" processes a confluence property for constructive reductions.
  arXiv  Detail & Related papers  (2024-03-07T16:02:31Z)
• Concurrent Asynchronous Byzantine Agreement in Expected-Constant Rounds, Revisited [3.8014967401609208]
  We present the first information-theoretic multi-valued OCC protocol in the asynchronous setting with optimal resiliency. Our protocol efficiently implements with an exponential-size domain. We also provide proof in Canetti's Universal Composability framework.
  arXiv  Detail & Related papers  (2023-12-22T08:10:11Z)
• Language-Oriented Communication with Semantic Coding and Knowledge Distillation for Text-to-Image Generation [53.97155730116369]
  We put forward a novel framework of language-oriented semantic communication (LSC) In LSC, machines communicate using human language messages that can be interpreted and manipulated via natural language processing (NLP) techniques for SC efficiency. We introduce three innovative algorithms: 1) semantic source coding (SSC), which compresses a text prompt into its key head words capturing the prompt's syntactic essence; 2) semantic channel coding ( SCC), that improves robustness against errors by substituting head words with their lenghthier synonyms; and 3) semantic knowledge distillation (SKD), that produces listener-customized prompts via in-context learning the listener's
  arXiv  Detail & Related papers  (2023-09-20T08:19:05Z)
• CRIL: A Concurrent Reversible Intermediate Language [0.0]
  We present a reversible intermediate language with composing for translating a high-level concurrent programming language to another lower-level concurrent programming language, keeping reversibility. We propose CRIL as an extension of RIL used by Mogensen for a functional reversible language, incorporating a multi-thread process invocation and the synchronization primitives based on the P-V operations.
  arXiv  Detail & Related papers  (2023-09-13T20:52:54Z)
• Unifying different notions of quantum incompatibility into a strict hierarchy of resource theories of communication [60.18814584837969]
  We introduce the notion of q-compatibility, which unifies different notions of POVMs, channels, and instruments incompatibility. We are able to pinpoint exactly what each notion of incompatibility consists of, in terms of information-theoretic resources.
  arXiv  Detail & Related papers  (2022-11-16T21:33:31Z)
• Neuro-Symbolic Causal Reasoning Meets Signaling Game for Emergent Semantic Communications [71.63189900803623]
  A novel emergent SC system framework is proposed and is composed of a signaling game for emergent language design and a neuro-symbolic (NeSy) artificial intelligence (AI) approach for causal reasoning. The ESC system is designed to enhance the novel metrics of semantic information, reliability, distortion and similarity.
  arXiv  Detail & Related papers  (2022-10-21T15:33:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.