A Chart Semantics for the Pi-Calculus
From MaRDI portal
Publication:2864369
DOI10.1016/j.entcs.2007.11.002zbMath1277.68164MaRDI QIDQ2864369
Johannes Borgström, Andrew D. Gordon, Andrew Phillips
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2007.11.002
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Uses Software
Cites Work
- A fully abstract may testing semantics for concurrent objects
- Modeling concurrency with partial orders
- Concurrency and atomicity
- A fully abstract semantics for causality in the \(\pi\)-calculus
- Non-interleaving semantics for mobile processes
- Typing correspondence assertions for communication protocols
- Secrecy and group creation
- Trace and testing equivalence on asynchronous processes
- The box algebra = Petri nets + process expressions
- Time, clocks, and the ordering of events in a distributed system
- Correspondence assertions for process synchronization in concurrent communications
- An open graph visualization system and its applications to software engineering
- Programming Languages and Systems
- Formal Methods for Components and Objects
- Event Structure Semantics for Nominal Calculi
- Programming Languages and Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
