Causal Trees, Finally
From MaRDI portal
Publication:3460861
DOI10.1007/978-3-319-25527-9_4zbMath1434.68323OpenAlexW2294256879MaRDI QIDQ3460861
Ugo Montanari, Roberto Bruni, Matteo Sammartino
Publication date: 8 January 2016
Published in: Programming Languages with Applications to Biology and Security (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11568/769902
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Categorical semantics of formal languages (18C50)
Cites Work
- Symmetries, local names and dynamic (de)-allocation of names
- About permutation algebras, (pre)sheaves and named sets
- A coalgebraic semantics for causality in Petri nets
- Universal coalgebra: A theory of systems
- Revisiting causality, coalgebraically
- Causality versus true-concurrency
- Families of Symmetries as Efficient Models of Resource Binding
- A note on causal trees and their applications to CCS
- Unnamed Item
- Unnamed Item
This page was built for publication: Causal Trees, Finally
