Comparing operational models of name-passing process calculi

DOI10.1016/J.IC.2005.08.004zbMATH Open1101.68697OpenAlexW2034986004MaRDI QIDQ2495643FDOQ2495643

Authors: Marcelo P. Fiore, Sam Staton 

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

Recommendations

• Comparing operational models of name-passing process calculi
• Models for name-passing processes: Interleaving and causal
• Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
• Symmetries, local names and dynamic (de)-allocation of names
• About permutation algebras, (pre)sheaves and named sets

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Models for name-passing processes: Interleaving and causal
• A fully abstract model for the \(\pi\)-calculus.
• A theory of bisimulation for the \(\pi\)-calculus
• Some characterization results for permutation algebras
• Comparing operational models of name-passing process calculi

Cited In (25)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Coinductive predicates and final sequences in a fibration
• A name abstraction functor for named sets
• Coalgebraic Modal Logic Beyond Sets
• A Categorical Model of the Fusion Calculus
• A presheaf environment for the explicit fusion calculus
• Title not available (Why is that?)
• Models for name-passing processes: Interleaving and causal
• Bialgebras for structural operational semantics: an introduction
• Initial Algebras of Terms with Binding and Algebraic Structure
• A congruence rule format for name-passing process calculi
• A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours
• Structural operational semantics for continuous state stochastic transition systems
• Symmetries, local names and dynamic (de)-allocation of names
• Families of symmetries as efficient models of resource binding
• About permutation algebras, (pre)sheaves and named sets
• Coinductive predicates and final sequences in a fibration
• Relating coalgebraic notions of bisimulation. With applications to name-passing process calculi (extended abstract)
• Exploring nominal cellular automata
• Equational presentations of functors and monads
• Spans of cospans
• Symmetries and Dualities in Name-Passing Process Calculi
• A well-behaved LTS for the pi-calculus (abstract)
• Title not available (Why is that?)

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

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