Calculating Colimits Compositionally

DOI10.1007/978-3-540-68679-8_36MaRDI QIDQ3507390zbMATH OpenOpenAlexFDO

Authors Robert Rosebrugh, N. Sabadini, R. F. C. Walters

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, http://hdl.handle.net/11383/1746288

Mathematics Subject Classification ID

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

Abstract: We show how finite limits and colimits can be calculated compositionally using the algebras of spans and cospans, and give as an application a proof of the Kleene Theorem on regular languages.

Recommendations

• Composition by Colimit and Formal Software Development
• Computable limits and colimits in categories of partial enumerated sets
• Homotopy composition of cospans
• scientific article; zbMATH DE number 2188548
• scientific article; zbMATH DE number 3999258

Cites work

• A universal property of the monoidal 2-category of cospans of finite linear orders and surjections
• Bicategories of processes
• Calculating Colimits Compositionally
• Cartesian bicategories. I
• Coherence for compact closed categories
• Feedback, trace and fixed-point semantics
• scientific article; zbMATH DE number 1189283 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 1107620 (Why is no real title available?)
• scientific article; zbMATH DE number 2049998 (Why is no real title available?)
• scientific article; zbMATH DE number 1497812 (Why is no real title available?)
• scientific article; zbMATH DE number 1522866 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• scientific article; zbMATH DE number 3344105 (Why is no real title available?)
• scientific article; zbMATH DE number 2222245 (Why is no real title available?)
• Minimisation and minimal realisation in Span(Graph)
• Normal forms for algebras of connections.
• Petri nets are monoids
• The geometry of tensor calculus. I
• Traced monoidal categories

Cited in

(10)

• Blocked-braid groups
• A recipe for black box functors
• Calculating Colimits Compositionally
• A Compositional Framework for Passive Linear Networks
• Spans of cospans
• Decorated Corelations
• A Note on an Old-Fashioned Algebra for (Disconnected) Graphs
• On the geometry and algebra of networks with state
• Composition by Colimit and Formal Software Development
• Computer Aided Verification

This page was built for publication: Calculating Colimits Compositionally

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3507390)