Metraipolis › archive › dc_f6a1e2d904ea

Concurrency, Causality and Conflict via Independence in Reversible Calculi — arXiv:2609.19495

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19495
License (as archived)
CC0-1.0
Archived
2026-10-10T05:44:50.811Z
SHA-256 of the archived text
49ed19496a18124536b2a2b975c7aa84d4f487abbdd8e9720d10d75f1b1832fe
Stable URL of this page
https://metraipolis.com/documento/dc_f6a1e2d904ea

How to cite

Concurrency, Causality and Conflict via Independence in Reversible Calculi — arXiv:2609.19495 — arXiv (en), https://arxiv.org/abs/2609.19495 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f6a1e2d904ea (Metraipolis archive dc_f6a1e2d904ea, sha256 49ed19496a18124536b2a2b975c7aa84d4f487abbdd8e9720d10d75f1b1832fe)
BibTeX
@misc{dcf6a1e2d904ea,
  title = {Concurrency, Causality and Conflict via Independence in Reversible Calculi — arXiv:2609.19495},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19495},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f6a1e2d904ea; sha256 49ed19496a18124536b2a2b975c7aa84d4f487abbdd8e9720d10d75f1b1832fe},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.19495. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Among the different ways of approaching the semantics of process calculi, true-concurrency models stand out for their ability to highlight subtle interplays between events. At their heart lie three crucial relations: concurrency, causality and conflict. This paper shows that reversibility, when endowed with a notion of independence, provides a rich tooling to study and characterise these true-concurrency relations. First, we prove that systems admitting pre-reversibility (i.e., that can be extended with an independence relation satisfying some basic axioms) have a unique notion of independence, events, concurrency, causality and conflict. We then analyse the relationship between independence and the true-concurrency relations, establishing novel independence-based characterisations of causality and conflict. Our second series of contributions revolves around two concrete process calculi and two syntactic notions defined on their transition labels, namely independence and dependence; we prove that they partition connected transitions and characterise elegantly concurrency on adjacent transitions. This part of our development was machine-checked using the proof assistant Beluga. Last, we study how the key mechanism commonly used in reversible process algebra can be used as a proxy to retrieve causality and core independence on past events. We conclude by discussing how our results extend beyond reversible systems.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-18 in cs.LO).
Categorie arXiv: Logic in Computer Science (cs.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.19495 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-10T05:08:21.098Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).