Models for name-passing processes: Interleaving and causal

DOI10.1016/j.ic.2003.12.003zbMath1101.68693OpenAlexW2037276526MaRDI QIDQ598191

Gian Luca Cattani, Peter Sewell

Publication date: 6 August 2004

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

Full work available at URL: https://doi.org/10.1016/j.ic.2003.12.003

zbMATH Keywords

\(\pi\)-calculusSemanticsCategorical modelsConcurrency and distributed computation

Mathematics Subject Classification ID

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

Related Items (16)

Reversibility in the higher-order \(\pi\)-calculus ⋮ Weak Bisimilarity Coalgebraically ⋮ Reactive systems, (semi-)saturated semantics and coalgebras on presheaves ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ Models for name-passing processes: Interleaving and causal ⋮ A coalgebraic semantics for causality in Petri nets ⋮ A stable non-interleaving early operational semantics for the pi-calculus ⋮ Event structure semantics for multiparty sessions ⋮ A compositional Petri net translation of general \(\pi\)-calculus terms ⋮ Free-algebra models for the \(\pi \)-calculus ⋮ A Categorical Model of the Fusion Calculus ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Revisiting causality, coalgebraically ⋮ Comparing operational models of name-passing process calculi ⋮ A congruence rule format for name-passing process calculi ⋮ A Well-behaved LTS for the Pi-calculus

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for name-passing processes: Interleaving and causal
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• Models for concurrency: Towards a classification
• Symbolic bisimulations
• Modal logics for mobile processes
• A fully abstract semantics for causality in the \(\pi\)-calculus
• Sheaves in geometry and logic: a first introduction to topos theory
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• Non-interleaving semantics for mobile processes
• Comparing locality and causality based equivalences
• CONCUR '97: concurrency theory. 8th international conference. Warsaw, Poland. July 1--4, 1997. Proceedings
• Presheaf models for CCS-like languages
• A fully abstract model for the \(\pi\)-calculus.
• A fully abstract denotational semantics for the \(\pi\)-calculus
• Generalized OM-bisimulation
• Testing equivalence for mobile processes
• A symbolic semantics for the \(\pi\)-calculus
• Bisimulation from open maps
• Concurrent Machines
• Causality and true concurrency: A data-flow analysis of the Pi-Calculus
• Mobile values, new names, and secure communication
• Comparing transition systems with independence and asynchronous transition systems

This page was built for publication: Models for name-passing processes: Interleaving and causal