A presheaf environment for the explicit fusion calculus
From MaRDI portal
Publication:2392481
DOI10.1007/s10817-011-9224-3zbMath1290.68089MaRDI QIDQ2392481
Vincenzo Ciancia, Maria Grazia Buscemi, Filippo Bonchi, Fabio Gadducci
Publication date: 1 August 2013
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-011-9224-3
68Q65: Abstract data types; algebraic specification
18C50: Categorical semantics of formal languages
Related Items
Name-passing calculi: from fusions to preorders and types, A behavioural theory for a \(\pi\)-calculus with preorders, A network-conscious \(\pi\)-calculus and its coalgebraic semantics, Exploring nominal cellular automata, A Class of Automata for the Verification of Infinite, Resource-Allocating Behaviours, Families of Symmetries as Efficient Models of Resource Binding
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetries, local names and dynamic (de)-allocation of names
- Category theory for operational semantics
- About permutation algebras, (pre)sheaves and named sets
- Pseudo-distributive laws and axiomatics for variable binding
- Some congruence properties for \(\pi\)-calculus bisimilarities
- A calculus of mobile processes. I
- A fully abstract model for the \(\pi\)-calculus.
- Universal coalgebra: A theory of systems
- Compositional SOS and beyond: A coalgebraic view of open systems
- A theory of bisimulation for the \(\pi\)-calculus
- Comparing operational models of name-passing process calculi
- Explicit fusions
- Coalgebraic Symbolic Semantics
- Relating Coalgebraic Notions of Bisimulation
- Families of Symmetries as Efficient Models of Resource Binding
- A Category of Explicit Fusions
- Coalgebraic Models for Reactive Systems
- Foundations of Software Science and Computation Structures
- A Categorical Model of the Fusion Calculus
- Symbolic Semantics Revisited
- Programming Languages and Systems
- Foundations of Software Science and Computational Structures
- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements