We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significantly, it uses the same syntax and operational semantics as the signal flow calculus Ð an algebraic formalism for signal flow graphs, which is a combinatorial model of computation of interest in control theory. Indeed, our approach stems from the simple but fruitful observation that, by replacing real numbers (modelling signals) with natural numbers (modelling resources) in the operational semantics, concurrent behaviour patterns emerge. The resource calculus is canonical: we equip it and its stateful extension with equational theories that characterise the underlying space of definable behavioursÐa convex algebraic universe of additive relationsÐ via isomorphisms of categories. Finally, we demonstrate that our calculus is sufficiently expressive to capture behaviour definable by classical Petri nets.

Bonchi F., Holland J., Piedeleu R., Sobocinski P., Zanasi F. (2019). Diagrammatic algebra: From linear to concurrent systems. PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES, 3(POPL), 1-28 [10.1145/3290338].

Diagrammatic algebra: From linear to concurrent systems

Zanasi F.
2019

Abstract

We introduce the resource calculus, a string diagrammatic language for concurrent systems. Significantly, it uses the same syntax and operational semantics as the signal flow calculus Ð an algebraic formalism for signal flow graphs, which is a combinatorial model of computation of interest in control theory. Indeed, our approach stems from the simple but fruitful observation that, by replacing real numbers (modelling signals) with natural numbers (modelling resources) in the operational semantics, concurrent behaviour patterns emerge. The resource calculus is canonical: we equip it and its stateful extension with equational theories that characterise the underlying space of definable behavioursÐa convex algebraic universe of additive relationsÐ via isomorphisms of categories. Finally, we demonstrate that our calculus is sufficiently expressive to capture behaviour definable by classical Petri nets.
2019
Bonchi F., Holland J., Piedeleu R., Sobocinski P., Zanasi F. (2019). Diagrammatic algebra: From linear to concurrent systems. PROCEEDINGS OF ACM ON PROGRAMMING LANGUAGES, 3(POPL), 1-28 [10.1145/3290338].
Bonchi F.; Holland J.; Piedeleu R.; Sobocinski P.; Zanasi F.
File in questo prodotto:
Eventuali allegati, non sono esposti

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/904562
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 45
  • ???jsp.display-item.citation.isi??? 36
  • OpenAlex ND
social impact