Flow models of distributed computations: Three equivalent semantics for CCS

From MaRDI portal
Publication:1341775

DOI10.1006/inco.1994.1088zbMath0938.68715OpenAlexW2031124364MaRDI QIDQ1341775

Gérard Boudol, Ilaria Castellani

Publication date: 11 January 1995

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00075078/file/RR-1484.pdf




Related Items

Reversibility in session-based concurrency: a fresh lookWell-behaved flow event structures for parallel composition and action refinementSecure Enforcement for Global Process SpecificationsReversing algebraic process calculiNested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary NetsA refined view of the box algebraCausal ambiguity and partial orders in event structuresNested-unit Petri netsA stable non-interleaving early operational semantics for the pi-calculusEvent structure semantics for multiparty sessionsTwenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process AlgebraReasoning about promises in weak memory models with event structuresTowards a Truly Concurrent Semantics for Reversible CCSFlow Unfolding of Multi-clock NetsMetric semantics for true concurrent real timeStatic versus dynamic reversibility in CCSProof-relevant π-calculus: a constructive account of concurrency and causalityEvent structures for the reversible early internal \(\pi\)-calculusDynamic Causality in Event StructuresContext-free event domains are recognizableConcurrent Reversible SessionsReversible sessions with flexible choicesTile formats for located and mobile systems.The box algebra = Petri nets + process expressionsOperational Semantics of Reversibility in Process AlgebraDynamic connectors for concurrency