Flow models of distributed computations: Three equivalent semantics for CCS
From MaRDI portal
Cited in
(26)- Flow unfolding of multi-clock nets
- The box algebra = Petri nets + process expressions
- Dynamic connectors for concurrency
- Secure Enforcement for Global Process Specifications
- Nested-unit Petri nets
- Event structures for the reversible early internal \(\pi\)-calculus
- Tile formats for located and mobile systems.
- Metric semantics for true concurrent real time
- Reversible sessions with flexible choices
- Context-free event domains are recognizable
- A refined view of the box algebra
- Static versus dynamic reversibility in CCS
- Reversibility in session-based concurrency: a fresh look
- A stable non-interleaving early operational semantics for the pi-calculus
- Proof-relevant \(\pi\)-calculus: a constructive account of concurrency and causality
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
- Reasoning about promises in weak memory models with event structures
- Causal ambiguity and partial orders in event structures
- Well-behaved flow event structures for parallel composition and action refinement
- Towards a Truly Concurrent Semantics for Reversible CCS
- Global types and event structure semantics for asynchronous multiparty sessions
- Concurrent reversible sessions
- Reversing algebraic process calculi
- Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets
- Event structure semantics for multiparty sessions
- Operational semantics of reversibility in process algebra
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)
