Models for name-passing processes: Interleaving and causal

DOI10.1016/J.IC.2003.12.003zbMATH Open1101.68693OpenAlexW2037276526MaRDI QIDQ598191FDOQ598191

Authors 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\)-calculusCategorical modelsConcurrency and distributed computationSemantics

Mathematics Subject Classification ID

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

Recommendations

• Comparing operational models of name-passing process calculi
• Comparing operational models of name-passing process calculi
• Non-interleaving semantics for mobile processes
• Algebraic theories for name-passing calculi
• Polarized name passing

Cites work

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

Cited in

(18)

• A compositional Petri net translation of general \(\pi\)-calculus terms
• A coalgebraic semantics for causality in Petri nets
• Event structure semantics for multiparty sessions
• Reactive systems, (semi-)saturated semantics and coalgebras on presheaves
• Models for name-passing processes: Interleaving and causal
• Weak bisimilarity coalgebraically
• Families of symmetries as efficient models of resource binding
• Comparing operational models of name-passing process calculi
• A categorical model of the fusion calculus
• Free-algebra models for the \(\pi \)-calculus
• Mathematical models of systems of transcription of name-and-surname groups
• Revisiting causality, coalgebraically
• A well-behaved LTS for the pi-calculus (abstract)
• Comparing operational models of name-passing process calculi
• A stable non-interleaving early operational semantics for the pi-calculus
• Reversibility in the higher-order \(\pi\)-calculus
• A congruence rule format for name-passing process calculi
• Typed event structures and the linear \(\pi \)-calculus

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

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