A fully abstract model for the -calculus.

DOI10.1006/INCO.2002.2968zbMATH Open1053.68066OpenAlexW3177659913MaRDI QIDQ1400720FDOQ1400720

Authors: Marcelo P. Fiore, Eugenio Moggi, 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

Recommendations

• A fully abstract denotational semantics for the \(\pi\)-calculus
• scientific article; zbMATH DE number 1759486
• An intensionally fully-abstract sheaf model for \(\pi\)
• Foundations of Software Science and Computational Structures
• Free-algebra models for the \(\pi \)-calculus
• A symbolic semantics for the \(\pi\)-calculus
• A fully-abstract semantics of \(\lambda\mu\) in the \(\pi\)-calculus
• scientific article; zbMATH DE number 6816930
• Full abstraction for polymorphic \(\pi \)-calculus
• Automata, Languages and Programming

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)

Cites Work

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

Cited In (36)

• A coinductive calculus for asynchronous side-effecting processes
• Foundations of Software Science and Computational Structures
• A name abstraction functor for named sets
• A semantic theory for value-passing processes based on the late approach
• A presheaf environment for the explicit fusion calculus
• Models for name-passing processes: Interleaving and causal
• Monoidal indeterminates and categories of possible worlds
• A Category of Explicit Fusions
• Title not available (Why is that?)
• An intensionally fully-abstract sheaf model for \(\pi\)
• First-order semantics for higher-order processes
• A coinductive calculus for asynchronous side-effecting processes
• An initial algebra approach to term rewriting systems with variable binders
• A fully abstract may testing semantics for concurrent objects
• Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
• Monoidal indeterminates and categories of possible worlds
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• Full abstraction for polymorphic \(\pi \)-calculus
• Automata, Languages and Programming
• A static analysis of cryptographic processes: the denotational approach
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Types and full abstraction for polyadic \(\pi\)-calculus
• Two cotensors in one: presentations of algebraic theories for local state and fresh names
• A categorical model of an \textbf{i/o}-typed \(\pi \)-calculus
• Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
• Free-algebra models for the \(\pi \)-calculus
• Comparing operational models of name-passing process calculi
• How to prove decidability of equational theories with second-order computation analyser SOL
• On the construction of free algebras for equational systems
• Families of symmetries as efficient models of resource binding
• About permutation algebras, (pre)sheaves and named sets
• Title not available (Why is that?)
• Weak bisimilarity coalgebraically
• Title not available (Why is that?)
• Foundations of Software Science and Computational Structures
• A resource analysis of the \(\pi\)-calculus

Uses Software

• LOTOS

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1400720)