A fully abstract denotational semantics for the \(\pi\)-calculus

DOI10.1016/S0304-3975(00)00331-5zbMath1014.68105MaRDI QIDQ1605174

Matthew C. B. Hennessy

Publication date: 15 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

\(\pi\)-calculusdenotational models

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

Weak Bisimilarity Coalgebraically, Contracts for Mobile Processes, Models for name-passing processes: Interleaving and causal, A semantic theory for value-passing processes based on the late approach, A fully abstract model for the \(\pi\)-calculus., Nominal Automata with Name Binding, Free-algebra models for the \(\pi \)-calculus, A static analysis of cryptographic processes: the denotational approach, A Resource Analysis of the π-calculus, A fully abstract may testing semantics for concurrent objects

Uses Software

• Facile

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Notions of computation and monads
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• Full abstraction in the lazy lambda calculus
• Lambda-calculi for (strict) parallel functions
• A theory of communicating processes with value passing
• Testing equivalences for processes
• A fully abstract model for the \(\pi\)-calculus.
• Algebraic theories for name-passing calculi
• Testing equivalence for mobile processes
• A theory of bisimulation for the \(\pi\)-calculus
• A domain equation for bisimulation
• Categories for Types