A stable non-interleaving early operational semantics for the pi-calculus
From MaRDI portal
Publication:2423752
DOI10.1016/j.jlamp.2019.02.006zbMath1423.68308OpenAlexW2916646198WikidataQ128329722 ScholiaQ128329722MaRDI QIDQ2423752
Christian Johansen, Håkon Normann, Thomas Troels Hildebrandt
Publication date: 20 June 2019
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jlamp.2019.02.006
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (2)
Event structures for the reversible early internal \(\pi\)-calculus ⋮ Preface to the special issue on open problems in concurrency theory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reversibility in the higher-order \(\pi\)-calculus
- ST-structures
- Models for name-passing processes: Interleaving and causal
- Locality and interleaving semantics in calculi for mobile processes
- A multiset semantics for the pi-calculus with replication
- Modal logics for mobile processes
- Configuration structures, event structures and Petri nets
- Typed event structures and the linear \(\pi \)-calculus
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of communicating systems
- A calculus of mobile processes. II
- Non-interleaving semantics for mobile processes
- A theory of processes with localities
- A static view of localities
- Flow models of distributed computations: Three equivalent semantics for CCS
- Comparing locality and causality based equivalences
- Locality based semantics for process algebras
- State space reduction using partial order techniques
- On the expressiveness of higher dimensional automata
- Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
- Psi-calculi: a framework for mobile processes with nominal data and logic
- Concurrency and Reversibility
- On Recursion, Replication and Scope Mechanisms in Process Calculi
- Compositional Event Structure Semantics for the Internal π-Calculus
- Concurrent Machines
- A fully abstract semantics for causality in the π-calculus
- OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- A Compositional Semantics for the Reversible p-Calculus
- A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
- Refinement of actions and equivalence notions for concurrent systems
This page was built for publication: A stable non-interleaving early operational semantics for the pi-calculus