scientific article
From MaRDI portal
Publication:3384917
Claudio Antares Mezzina, Nobuko Yoshida, Iain Phillips, Doriana Medić
Publication date: 17 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?EXPRESSSOS2018.8
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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)
Cites Work
- Reversibility in the higher-order \(\pi\)-calculus
- A fully abstract semantics for causality in the \(\pi\)-calculus
- A calculus of communicating systems
- An algebraic interpretation of the \(\lambda\beta K\)-calculus; and an application of a labelled \(\lambda\)-calculus
- Non-interleaving semantics for mobile processes
- GSOS and finite labelled transition systems
- Reversing algebraic process calculi
- Rigid Families for CCS and the $$\pi $$ -calculus
- Modelling of Bonding with Processes and Events
- Event Structure Semantics of Parallel Extrusion in the Pi-Calculus
- Psi-calculi: a framework for mobile processes with nominal data and logic
- On the Statistical Thermodynamics of Reversible Communicating Processes
- Static VS Dynamic Reversibility in CCS
- Proof-relevant π-calculus: a constructive account of concurrency and causality
- A Compositional Semantics for the Reversible p-Calculus
- CONCUR 2004 - Concurrency Theory
- Concurrent Flexible Reversibility
- Logical Reversibility of Computation
- A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
- CONCUR 2005 – Concurrency Theory
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
