A fully abstract model for the \(\pi\)-calculus.

DOI10.1006/inco.2002.2968zbMath1053.68066OpenAlexW3177659913MaRDI QIDQ1400720

Eugenio Moggi, Marcelo P. Fiore, Davide Sangiorgi

Publication date: 2002

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2002.2968

zbMATH Keywords

equational theory of metalanguage

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (28)

Weak Bisimilarity Coalgebraically ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ An initial algebra approach to term rewriting systems with variable binders ⋮ About permutation algebras, (pre)sheaves and named sets ⋮ Types and full abstraction for polyadic \(\pi\)-calculus ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ A presheaf environment for the explicit fusion calculus ⋮ Models for name-passing processes: Interleaving and causal ⋮ A coinductive calculus for asynchronous side-effecting processes ⋮ A semantic theory for value-passing processes based on the late approach ⋮ A Category of Explicit Fusions ⋮ How to prove decidability of equational theories with second-order computation analyser SOL ⋮ Monoidal indeterminates and categories of possible worlds ⋮ Free-algebra models for the \(\pi \)-calculus ⋮ First–order Semantics for Higher–order Processes ⋮ A static analysis of cryptographic processes: the denotational approach ⋮ A Resource Analysis of the π-calculus ⋮ A fully abstract may testing semantics for concurrent objects ⋮ Comparing operational models of name-passing process calculi ⋮ Unnamed Item ⋮ Monoidal Indeterminates and Categories of Possible Worlds ⋮ Two Cotensors in One: Presentations of Algebraic Theories for Local State and Fresh Names ⋮ On the construction of free algebras for equational systems ⋮ A Coinductive Calculus for Asynchronous Side-Effecting Processes ⋮ Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency ⋮ A fully abstract denotational semantics for the \(\pi\)-calculus ⋮ A Name Abstraction Functor for Named Sets

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Notions of computation and monads
• A calculus of mobile processes. II
• A fully abstract denotational model for higher-order processes
• A representable approach to finite nondeterminism
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Algebraic theories for name-passing calculi
• A theory of bisimulation for the \(\pi\)-calculus
• A symbolic semantics for the \(\pi\)-calculus
• CPO models for compact GSOS languages
• A domain equation for bisimulation
• The Category-Theoretic Solution of Recursive Domain Equations
• A term model for synchronous processes
• Process Algebra
• On the bisimulation proof method
• Processes as terms: non-well-founded models for bisimulation
• Axiomatic Domain Theory in Categories of Partial Maps

This page was built for publication: A fully abstract model for the \(\pi\)-calculus.