{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T06:25:55Z","timestamp":1773901555985,"version":"3.50.1"},"reference-count":32,"publisher":"Association for Computing Machinery (ACM)","issue":"POPL","license":[{"start":{"date-parts":[[2019,1,2]],"date-time":"2019-01-02T00:00:00Z","timestamp":1546387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2019,1,2]]},"abstract":"<jats:p>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.<\/jats:p>\n          <jats:p>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.<\/jats:p>","DOI":"10.1145\/3290338","type":"journal-article","created":{"date-parts":[[2019,1,4]],"date-time":"2019-01-04T13:33:51Z","timestamp":1546608831000},"page":"1-28","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":32,"title":["Diagrammatic algebra: from linear to concurrent systems"],"prefix":"10.1145","volume":"3","author":[{"given":"Filippo","family":"Bonchi","sequence":"first","affiliation":[{"name":"University of Pisa, Italy"}]},{"given":"Joshua","family":"Holland","sequence":"additional","affiliation":[{"name":"University of Southampton, UK"}]},{"given":"Robin","family":"Piedeleu","sequence":"additional","affiliation":[{"name":"University of Oxford, UK"}]},{"given":"Pawe\u0142","family":"Soboci\u0144ski","sequence":"additional","affiliation":[{"name":"University of Southampton, UK"}]},{"given":"Fabio","family":"Zanasi","sequence":"additional","affiliation":[{"name":"University College London, UK"}]}],"member":"320","published-online":{"date-parts":[[2019,1,2]]},"reference":[{"key":"e_1_2_2_1_1","volume-title":"What are the fundamental structures of concurrency? We still don\u2019t know! CoRR abs\/1401.4973","author":"Abramsky Samson","year":"2014"},{"key":"e_1_2_2_2_1","first-page":"836","article-title":"Categories In Control","volume":"30","author":"Baez John","year":"2015","journal-title":"Theory and Applications of Categories"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1047125.1047126"},{"key":"e_1_2_2_4_1","volume-title":"Refinement for Signal Flow Graphs. In 28th International Conference on Concurrency Theory, CONCUR 2017","author":"Bonchi Filippo","year":"2017"},{"key":"e_1_2_2_5_1","volume-title":"Functorial Semantics for Relational Theories. arXiv preprint arXiv:1711.08699","author":"Bonchi Filippo","year":"2017"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44584-6_30"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676993"},{"key":"e_1_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.03.002"},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2016.06.002"},{"key":"e_1_2_2_10_1","volume-title":"RelMiS","author":"Bruni Roberto","year":"2001"},{"key":"e_1_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040235.2040263"},{"key":"e_1_2_2_12_1","volume-title":"Interactions. Log Meth Comput Sci 9, 16","author":"Bruni Roberto","year":"2013"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-4049(87)90121-6"},{"key":"e_1_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/13\/4\/043016"},{"key":"e_1_2_2_15_1","volume-title":"Picturing Quantum Processes - A first course in Quantum Theory and Diagrammatic Reasoning","author":"Coecke Bob"},{"key":"e_1_2_2_16_1","first-page":"557","article-title":"A new description of orthogonal bases","volume":"23","author":"Coecke Bob","year":"2012","journal-title":"Math. Struct. Comp. Sci."},{"key":"e_1_2_2_17_1","first-page":"380","article-title":"Corelations are the prop for extraspecial commutative Frobenius monoids","volume":"32","author":"Coya Brendan","year":"2017","journal-title":"Theory and Applications of Categories"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.2307\/2370405"},{"key":"e_1_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933575.2934556"},{"key":"e_1_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2603088.2603124"},{"key":"e_1_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-4049(96)00012-6"},{"key":"e_1_2_2_22_1","doi-asserted-by":"crossref","unstructured":"Joachim Kock. 2003. Frobenius algebras and 2D topological quantum field theories. CUP.  Joachim Kock. 2003. Frobenius algebras and 2D topological quantum field theories. CUP.","DOI":"10.1017\/CBO9780511615443"},{"key":"e_1_2_2_23_1","first-page":"147","article-title":"Composing PROPs","volume":"13","author":"Lack Stephen","year":"2004","journal-title":"Theory and Application of Categories"},{"key":"e_1_2_2_24_1","volume-title":"Feedback Theory: I. Some Properties of Signal Flow Graphs. MIT Research Laboratory of Electronics.","author":"Mason Samuel J","year":"1953"},{"key":"e_1_2_2_25_1","volume-title":"European Workshop on Applications and Theory in Petri Nets. Springer, 307\u2013330","author":"Mazurkiewicz Antoni","year":"1987"},{"key":"e_1_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/646730.703687"},{"key":"e_1_2_2_27_1","volume-title":"Noordwijkerhout, The Netherlands","author":"Nielsen Mogens","year":"1993"},{"key":"e_1_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02424-5_4"},{"key":"e_1_2_2_29_1","first-page":"289","article-title":"A survey of graphical languages for monoidal categories","volume":"13","author":"Selinger Peter","year":"2011","journal-title":"Springer Lecture Notes in Physics"},{"key":"e_1_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/111970.111991"},{"key":"e_1_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCS.2007.906923"},{"key":"e_1_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2016.09.046"}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290338","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3290338","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:58:04Z","timestamp":1750208284000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3290338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,2]]},"references-count":32,"journal-issue":{"issue":"POPL","published-print":{"date-parts":[[2019,1,2]]}},"alternative-id":["10.1145\/3290338"],"URL":"https:\/\/doi.org\/10.1145\/3290338","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,2]]},"assertion":[{"value":"2019-01-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}