Typed event structures and the linear \(\pi \)-calculus
From MaRDI portal
Publication:964488
DOI10.1016/j.tcs.2010.01.024zbMath1200.68165OpenAlexW2060704426MaRDI QIDQ964488
Nobuko Yoshida, Daniele Varacca
Publication date: 22 April 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.01.024
Related Items
Reversibility in the higher-order \(\pi\)-calculus ⋮ Behavioural logics for configuration structures ⋮ A Verification Technique for Reversible Process Algebra ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Event structure semantics for multiparty sessions ⋮ An approach to innocent strategies as graphs ⋮ Unnamed Item ⋮ A Truly Concurrent Game Model of the Asynchronous $$\pi $$-Calculus ⋮ Concurrent semantics for fusions: weak prime domains and connected event structures ⋮ Minimisation of event structures ⋮ An interpretation of CCS into ludics ⋮ Probabilistic π-Calculus and Event Structures
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for name-passing processes: Interleaving and causal
- Strong normalisation in the \(\pi\)-calculus
- \(\pi\)-calculus, internal mobility, and agent-passing calculi
- A multiset semantics for the pi-calculus with replication
- An exact correspondence between a typed pi-calculus and polarised proof-nets
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS
- A distributed operational semantics of CCS based on condition/event systems
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Petri nets, event structures and domains. I
- Sequential algorithms on concrete data structures
- Non-interleaving semantics for mobile processes
- Concrete domains
- On reduction-based process semantics
- Probabilistic event structures and domains
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- A Graph Abstract Machine Describing Event Structure Composition
- Probabilistic π-Calculus and Event Structures
- Compositional Event Structure Semantics for the Internal π-Calculus
- Ludics is a Model for the Finitary Linear Pi-Calculus
- Free Choice Petri Nets
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- Foundations of Software Science and Computation Structures
- CONCUR 2004 - Concurrency Theory
- Trustworthy Global Computing
- Foundations of Software Science and Computational Structures
- Event Structure Semantics for Nominal Calculi
