DROPS

Document

DOI: 10.4230/LIPIcs.CALCO.2017.2

Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks

Authors: Alessandro Gianola, Stefano Kasangian, and Nicoletta Sabadini

Published in: LIPIcs, Volume 72, 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)

Abstract

Span(Graph) was introduced by Katis, Sabadini and Walters as a categorical algebra of automata with interfaces, with main operation being communicating-parallel composition. Additional operations provide also a calculus of connectors or wires among components. A system so described has two aspects: an informal network geometry arising from the algebraic expression, and a space of states and transition given by its evaluation in Span(Graph). So, Span(Graph) yields purely compositional, hierarchical descriptions of networks with a fixed topology . The dual algebra Cospan(Graph) allows to describe also the sequential behaviour of systems. Both algebras, of spans and of cospans, are symmetrical monoidal categories with commutative separable algebra structures on the objects. Hence, the combined algebra CospanSpan(Graph) can be interpreted as a general algebra for reconfigurable/hierarchical networks, generalizing the usual Kleene's algebra for classical automata. We present some examples of systems described in this setting.

Cite as

Alessandro Gianola, Stefano Kasangian, and Nicoletta Sabadini. Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks. In 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 72, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)

Copy BibTex To Clipboard

@InProceedings{gianola_et_al:LIPIcs.CALCO.2017.2,
  author =	{Gianola, Alessandro and Kasangian, Stefano and Sabadini, Nicoletta},
  title =	{{Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks}},
  booktitle =	{7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)},
  pages =	{2:1--2:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-033-0},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{72},
  editor =	{Bonchi, Filippo and K\"{o}nig, Barbara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2017.2},
  URN =		{urn:nbn:de:0030-drops-80535},
  doi =		{10.4230/LIPIcs.CALCO.2017.2},
  annote =	{Keywords: Categories, Automata, Composition, Networks}
}

Search Results

Documents authored by Kasangian, Stefano

Cospan/Span(Graph): an Algebra for Open, Reconfigurable Automata Networks

Abstract

Cite as

Thanks for your feedback!

Could not send message