A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus

DOI10.1007/978-3-319-53733-7_3zbMath1485.68161OpenAlexW2587991952MaRDI QIDQ5738986

Christian Johansen, Håkon Normann, Thomas Troels Hildebrandt

Publication date: 1 June 2017

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://curis.ku.dk/ws/files/241102793/1_s2.0_S2352220817302249_main.pdf

zbMATH Keywords

stabilityconcurrencyasynchronous transition systemspi-calculusnon-interleavingearly operational semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

A stable non-interleaving early operational semantics for the pi-calculus ⋮ Unnamed Item ⋮ A parametric framework for reversible \(\pi\)-calculi ⋮ A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reversibility in the higher-order \(\pi\)-calculus
• Locality and interleaving semantics in calculi for mobile processes
• A fully abstract semantics for causality in the \(\pi\)-calculus
• A calculus of communicating systems
• A calculus of mobile processes. I
• A theory of processes with localities
• State space reduction using partial order techniques
• Concurrent bisimulations in Petri nets
• 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
• Concurrent Machines
• 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