Flow models of distributed computations: Three equivalent semantics for CCS

DOI10.1006/INCO.1994.1088MaRDI QIDQ1341775zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Cited in

(30)

• Context-free event domains are recognizable
• Dynamic connectors for concurrency
• Tile formats for located and mobile systems.
• The box algebra = Petri nets + process expressions
• Well-behaved flow event structures for parallel composition and action refinement
• Static versus dynamic reversibility in CCS
• Reversible sessions with flexible choices
• Reversibility in session-based concurrency: a fresh look
• Nested-unit Petri nets
• A stable non-interleaving early operational semantics for the pi-calculus
• Reversing algebraic process calculi
• Event structure semantics for multiparty sessions
• Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
• Secure Enforcement for Global Process Specifications
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
• Proof-relevant \(\pi\)-calculus: a constructive account of concurrency and causality
• A refined view of the box algebra
• Concurrent reversible sessions
• Towards a Truly Concurrent Semantics for Reversible CCS
• Flow unfolding of multi-clock nets
• Operational semantics of reversibility in process algebra
• Event structures for the reversible early internal \(\pi\)-calculus
• Metric semantics for true concurrent real time
• Causal ambiguity and partial orders in event structures
• Reasoning about promises in weak memory models with event structures
• Global types and event structure semantics for asynchronous multiparty sessions
• Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets
• Independence and causality in the reversible concurrent setting
• Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings
• A truly concurrent semantics for reversible CCS

This page was built for publication: Flow models of distributed computations: Three equivalent semantics for CCS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1341775)