Calculating Colimits Compositionally

DOI10.1007/978-3-540-68679-8_36zbMath1144.18003arXiv0712.2525OpenAlexW1494772149MaRDI QIDQ3507390

Robert F. C. Walters, Nicoletta Sabadini, Robert D. Rosebrugh

Publication date: 19 June 2008

Published in: Concurrency, Graphs and Models (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0712.2525

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Categories of machines, automata (18B20)

Related Items

Calculating Colimits Compositionally, On the geometry and algebra of networks with state, A Compositional Framework for Passive Linear Networks, Blocked-braid groups, Spans of cospans, A Note on an Old-Fashioned Algebra for (Disconnected) Graphs, Decorated Corelations, A recipe for black box functors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bicategories of processes
• Petri nets are monoids
• Cartesian bicategories. I
• Coherence for compact closed categories
• The geometry of tensor calculus. I
• Normal forms for algebras of connections.
• Calculating Colimits Compositionally
• Minimisation and minimal realisation in Span(Graph)
• Feedback, trace and fixed-point semantics
• Traced monoidal categories
• A universal property of the monoidal 2-category of cospans of finite linear orders and surjections