Calculating Colimits Compositionally

Authors:
Robert Rosebrugh;Nicoletta Sabadini;Robert F. Walters
Affiliations:
Department of Mathematics and Statistics, Mt. Allison University, Sackville, Canada;Dipartimento di Scienze delle Cultura, Politiche e dell'Informazione, Università dell'Insubria, Italy;Dipartimento di Scienze delle Cultura, Politiche e dell'Informazione, Università dell'Insubria, Italy
Venue:
Concurrency, Graphs and Models
Year:
2008

Citing 8
Cited 0

Petri nets are moniods

Information and Computation
Iteration theories: the equational logic of iterative processes

Iteration theories: the equational logic of iterative processes
Normal forms for algebras of connections

Theoretical Computer Science
An inductive view of graph transformation

WADT '97 Selected papers from the 12th International Workshop on Recent Trends in Algebraic Development Techniques
Span(Graph): A Categorial Algebra of Transition Systems

AMAST '97 Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology
A Formalization of the IWIM Model

COORDINATION '00 Proceedings of the 4th International Conference on Coordination Languages and Models
A Categorical Semantics of Quantum Protocols

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Minimisation and minimal realisation in Span(Graph)

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.