Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus

DOI10.1016/j.tcs.2005.03.014zbMath1077.68065OpenAlexW2077397316MaRDI QIDQ2566037

Ugo Montanari, Marco Pistore

Publication date: 22 September 2005

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2005.03.014

zbMATH Keywords

\(\pi\)-calculusConcurrency and distributed computationAutomata theoryCategorical models and logicsCoinductive techniques

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)

A compositional coalgebraic model of fusion calculus ⋮ About permutation algebras, (pre)sheaves and named sets ⋮ Families of Symmetries as Efficient Models of Resource Binding ⋮ Order algebras: a quantitative model of interaction ⋮ A coalgebraic semantics for causality in Petri nets ⋮ Symmetries, local names and dynamic (de)-allocation of names ⋮ Ugo Montanari and Concurrency Theory ⋮ Models of Computation: A Tribute to Ugo Montanari’s Vision ⋮ A Category of Explicit Fusions ⋮ Ugo Montanari and Software Verification ⋮ Session coalgebras: a coalgebraic view on session types and communication protocols ⋮ Causality for mobile processes ⋮ A network-conscious \(\pi\)-calculus and its coalgebraic semantics ⋮ Network-conscious \(\pi\)-calculus -- a model of Pastry ⋮ Typed event structures and the linear \(\pi \)-calculus ⋮ Hard Life with Weak Binders ⋮ Revisiting causality, coalgebraically ⋮ A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours ⋮ A Compositional Coalgebraic Model of a Fragment of Fusion Calculus ⋮ A Name Abstraction Functor for Named Sets

Cites Work

• Higher-level synchronising devices in Meije-SCCS
• A calculus of mobile processes. II
• On bisimulations for the asynchronous \(\pi\)-calculus
• A calculus for cryptographic protocols: The spi calculus
• A fully abstract model for the \(\pi\)-calculus.
• Universal coalgebra: A theory of systems
• \(\pi\)-calculus in (Co)inductive-type theory
• Compositional SOS and beyond: A coalgebraic view of open systems
• Objects in the \(\pi\)-calculus
• A theory of bisimulation for the \(\pi\)-calculus
• Bisimulation from open maps
• A calculus of mobile agents
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus