Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory.

A universal construction for (Co)Relations / Fong B.; Zanasi F.. - ELETTRONICO. - 72:(2017), pp. 12.1-12.16. (Intervento presentato al convegno 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) tenutosi a Ljubljana, Slovenia nel 14 - 16 June 2017) [10.4230/LIPIcs.CALCO.2017.12].

A universal construction for (Co)Relations

Zanasi F.
2017

Abstract

Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic interpretation for diagrams is given in terms of relations or corelations (generalised equivalence relations) of some kind. In this paper we show how semantic categories of both relations and corelations can be characterised as colimits of simpler categories. This modular perspective is important as it simplifies the task of giving a complete axiomatisation for semantic equivalence of string diagrams. Moreover, our general result unifies various theorems that are independently found in literature and are relevant for program semantics, quantum computation and control theory.
2017
7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017)
1
16
A universal construction for (Co)Relations / Fong B.; Zanasi F.. - ELETTRONICO. - 72:(2017), pp. 12.1-12.16. (Intervento presentato al convegno 7th Conference on Algebra and Coalgebra in Computer Science (CALCO 2017) tenutosi a Ljubljana, Slovenia nel 14 - 16 June 2017) [10.4230/LIPIcs.CALCO.2017.12].
Fong B.; Zanasi F.
File in questo prodotto:
File Dimensione Formato  
LIPIcs-CALCO-2017-12.pdf

accesso aperto

Tipo: Versione (PDF) editoriale
Licenza: Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione 584.44 kB
Formato Adobe PDF
584.44 kB Adobe PDF Visualizza/Apri

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11585/904903
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 3
  • ???jsp.display-item.citation.isi??? ND
social impact