Comparing operational models of name-passing process calculi

DOI10.1016/j.ic.2005.08.004zbMath1101.68697OpenAlexW2034986004MaRDI QIDQ2495643

Sam Staton, Marcelo P. Fiore

Publication date: 30 June 2006

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

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

zbMATH Keywords

internal labelled transition systemsSchanuel topos

Mathematics Subject Classification ID

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

Related Items (20)

Coinductive predicates and final sequences in a fibration ⋮ Relating Coalgebraic Notions of Bisimulation ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ A presheaf environment for the explicit fusion calculus ⋮ Exploring nominal cellular automata ⋮ Unnamed Item ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Bialgebras for structural operational semantics: an introduction ⋮ Unnamed Item ⋮ Equational presentations of functors and monads ⋮ Initial Algebras of Terms with Binding and Algebraic Structure ⋮ A Categorical Model of the Fusion Calculus ⋮ Spans of cospans ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ A congruence rule format for name-passing process calculi ⋮ Coinductive predicates and final sequences in a fibration ⋮ Structural operational semantics for continuous state stochastic transition systems ⋮ Coalgebraic Modal Logic Beyond Sets ⋮ A Well-behaved LTS for the Pi-calculus ⋮ A Name Abstraction Functor for Named Sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models for name-passing processes: Interleaving and causal
• A fully abstract model for the \(\pi\)-calculus.
• A theory of bisimulation for the \(\pi\)-calculus

This page was built for publication: Comparing operational models of name-passing process calculi