Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
From MaRDI portal
Publication:2864372
DOI10.1016/j.entcs.2007.11.006zbMath1277.68167OpenAlexW2035827916MaRDI QIDQ2864372
Frank D. Valencia, D. Cacciagrano, Jesús Aranda, Flavio Corradini
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.006
Related Items (8)
On the validity of encodings of the synchronous in the asynchronous \(\pi\)-calculus ⋮ Theory of interaction ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Towards a unified approach to encodability and separation results for process calculi ⋮ Towards a Unified Approach to Encodability and Separation Results for Process Calculi ⋮ On the expressiveness of interaction ⋮ FROM COMPUTING TO INTERACTION: ON THE EXPRESSIVENESS OF ASYNCHRONOUS PI-CALCULUS
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Security protocols: from linear to classical logic by abstract interpretation
- A calculus of mobile processes. I
- Testing equivalences for processes
- Truly concurrent constraint programming
- On the symbolic reduction of processes with cryptographic functions.
- What is a ``good encoding of guarded choice?
- Linear concurrent constraint programming: Operational and phase semantics
- The name discipline of uniform receptiveness
- Separation Results Via Leader Election Problems
- Broadcast Calculus Interpreted in CCS upto Bisimulation
- Foundations of Software Science and Computation Structures
- Foundations of Software Science and Computation Structures
This page was built for publication: Linearity, Persistence and Testing Semantics in the Asynchronous Pi-Calculus
