Cospan/Span(Graph): An Algebra for open, reconfigurable automata networks

DOI10.4230/LIPIcs.CALCO.2017.2zbMath1433.68223OpenAlexW2773326053MaRDI QIDQ4580196

Alessandro Gianola, Stefano Kasangian, Nicoletta Sabadini

Publication date: 13 August 2018

Full work available at URL: https://dblp.uni-trier.de/db/conf/calco/calco2017.html#GianolaKS17

zbMATH Keywords

automatacategoriescompositionautomata networks

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Monoidal categories, symmetric monoidal categories (18M05)

Related Items (2)

Compositional Specification in Rewriting Logic ⋮ A recipe for black box functors

This page was built for publication: Cospan/Span(Graph): An Algebra for open, reconfigurable automata networks