A categorical model of the fusion calculus
DOI10.1016/J.ENTCS.2008.10.017zbMATH Open1286.68355OpenAlexW2030716060MaRDI QIDQ5415643FDOQ5415643
Authors: Marino Miculan 
Publication date: 13 May 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.10.017
Recommendations
Eilenberg-Moore and Kleisli constructions for monads (18C20) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Comparing operational models of name-passing process calculi
- Title not available (Why is that?)
- Models for name-passing processes: Interleaving and causal
- Notions of computation and monads
- CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements
- Title not available (Why is that?)
- Explicit fusions
- Proceedings of the 7th workshop on coalgebraic methods in computer science (CMCS), Barcelona, Spain, March 27--29, 2004
- On the structure of categories of coalgebras
- A theory of bisimulation for the \(\pi\)-calculus
- Variations on mobile processes
- Relationally staged computations in calculi of mobile processes
- A compositional coalgebraic model of a fragment of fusion calculus
- Title not available (Why is that?)
- Reactive Systems over Directed Bigraphs
- Foundations of Software Science and Computational Structures
- Typed Lambda Calculi and Applications
Cited In (16)
- Coinductive predicates and final sequences in a fibration
- A presheaf environment for the explicit fusion calculus
- A Category of Explicit Fusions
- Algebra and Coalgebra in Computer Science
- Structural operational semantics for continuous state stochastic transition systems
- A network-conscious \(\pi\)-calculus and its coalgebraic semantics
- A compositional coalgebraic model of fusion calculus
- A categorical model of an \textbf{i/o}-typed \(\pi \)-calculus
- Symmetries, local names and dynamic (de)-allocation of names
- Families of symmetries as efficient models of resource binding
- Network Conscious π-calculus: A Concurrent Semantics
- Coinductive predicates and final sequences in a fibration
- A compositional coalgebraic model of a fragment of fusion calculus
- A graphical fusion calculus
- Behavioural equivalences for coalgebras with unobservable moves
- A class of automata for the verification of infinite, resource-allocating behaviours
Uses Software
This page was built for publication: A categorical model of the fusion calculus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5415643)
