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

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

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)

Cites Work

• A fully abstract semantics for causality in the \(\pi\)-calculus
• Sheaves in geometry and logic: a first introduction to topos theory
• Non-interleaving semantics for mobile processes
• Bisimulation from open maps
• Concurrent Machines
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Models for name-passing processes: Interleaving and causal
• Modal logics for mobile processes
• A calculus of mobile processes. II
• A calculus for cryptographic protocols: The spi calculus
• Mobile values, new names, and secure communication
• Title not available (Why is that?)
• \(\pi\)-calculus, internal mobility, and agent-passing calculi
• A fully abstract model for the \(\pi\)-calculus.
• Symbolic bisimulations
• A symbolic semantics for the \(\pi\)-calculus
• Title not available (Why is that?)
• Models for concurrency: Towards a classification
• Comparing transition systems with independence and asynchronous transition systems
• Testing equivalence for mobile processes
• A fully abstract denotational semantics for the \(\pi\)-calculus
• 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
• Generalized OM-bisimulation
• Title not available (Why is that?)
• Causality and true concurrency: A data-flow analysis of the Pi-Calculus

Cited In (18)

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

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)