A stable non-interleaving early operational semantics for the pi-calculus
DOI10.1016/J.JLAMP.2019.02.006zbMATH Open1423.68308OpenAlexW2916646198WikidataQ128329722 ScholiaQ128329722MaRDI QIDQ2423752FDOQ2423752
Authors: Thomas Hildebrandt, Christian Johansen, Håkon Normann 
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
Recommendations
- A stable non-interleaving early operational semantics for the pi-calculus
- Event structure semantics of parallel extrusion in the pi-calculus
- Compositional Event Structure Semantics for the Internal π-Calculus
- Non-interleaving semantics for mobile processes
- A fully abstract semantics for causality in the π-calculus
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Non-interleaving semantics for mobile processes
- On the expressiveness of higher dimensional automata
- Reversibility in the higher-order \(\pi\)-calculus
- Event structure semantics of parallel extrusion in the pi-calculus
- Compositional Event Structure Semantics for the Internal π-Calculus
- Concurrent Machines
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A compositional semantics for the reversible \(\pi\)-calculus
- Models for name-passing processes: Interleaving and causal
- Modal logics for mobile processes
- Typed event structures and the linear \(\pi \)-calculus
- A calculus of mobile processes. II
- Psi-calculi: a framework for mobile processes with nominal data and logic
- ST-structures
- Refinement of actions and equivalence notions for concurrent systems
- Configuration structures, event structures and Petri nets
- A calculus of communicating systems
- The \(\pi\)-calculus: A theory of mobile processes
- Categorical models for concurrency: Independence, fairness and dataflow
- State space reduction using partial order techniques
- Title not available (Why is that?)
- Comparing locality and causality based equivalences
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus
- A fully abstract semantics for causality in the π-calculus
- A theory of processes with localities
- A static view of localities
- OBSERVING DISTRIBUTION IN PROCESSES: STATIC AND DYNAMIC LOCALITIES
- A stable non-interleaving early operational semantics for the pi-calculus
- Locality and interleaving semantics in calculi for mobile processes
- A multiset semantics for the pi-calculus with replication
- Concurrency and reversibility
- On Recursion, Replication and Scope Mechanisms in Process Calculi
- Flow models of distributed computations: Three equivalent semantics for CCS
- Locality based semantics for process algebras
- Process algebras with localities.
Cited In (9)
- Event structures for the reversible early internal \(\pi\)-calculus
- Preface to the special issue on open problems in concurrency theory
- A stable non-interleaving early operational semantics for the pi-calculus
- Event structure semantics of parallel extrusion in the pi-calculus
- An axiomatic theory for reversible computation
- Compositional Event Structure Semantics for the Internal π-Calculus
- Trustworthy Global Computing
- A well-behaved LTS for the pi-calculus (abstract)
- A multiset semantics for the pi-calculus with replication
This page was built for publication: A stable non-interleaving early operational semantics for the pi-calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423752)
