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.
Supplemental Material
- Samson Abramsky. 2014. What are the fundamental structures of concurrency? We still don’t know! CoRR abs/1401.4973 (2014).Google Scholar
- John Baez and Jason Erbele. 2015. Categories In Control. Theory and Applications of Categories 30 (2015), 836–881.Google Scholar
- Paolo Baldan, Andrea Corradini, Hartmut Ehrig, and Reiko Heckel. 2005. Compositional semantics for open Petri nets based on deterministic processes. Mathematical Structures in Computer Science 15, 1 (2005), 1–35. Google Scholar
Digital Library
- Filippo Bonchi, Joshua Holland, Dusko Pavlovic, and Paweł Sobociński. 2017a. Refinement for Signal Flow Graphs. In 28th International Conference on Concurrency Theory, CONCUR 2017, September 5-8, 2017, Berlin, Germany. 24:1–24:16.Google Scholar
- Filippo Bonchi, Dusko Pavlovic, and Pawel Sobocinski. 2017b. Functorial Semantics for Relational Theories. arXiv preprint arXiv:1711.08699 (2017).Google Scholar
- Filippo Bonchi, Pawel Sobocinski, and Fabio Zanasi. 2014. A Categorical Semantics of Signal Flow Graphs. In CONCUR 2014. 435–450.Google Scholar
Cross Ref
- Filippo Bonchi, Pawel Sobocinski, and Fabio Zanasi. 2015. Full Abstraction for Signal Flow Graphs. In POPL 2015. 515–526. Google Scholar
Digital Library
- Filippo Bonchi, Pawel Sobocinski, and Fabio Zanasi. 2017c. The Calculus of Signal Flow Diagrams I: Linear relations on streams. Inf. Comput. 252 (2017), 2–29. Google Scholar
Digital Library
- Filippo Bonchi, Paweł Sobociński, and Fabio Zanasi. 2017d. Interacting Hopf Algebras. Journal of Pure and Applied Algebra 221, 1 (2017), 144–184.Google Scholar
Cross Ref
- Roberto Bruni and Fabio Gadducci. 2001. Some Algebraic Laws for Spans (and Their Connections With Multi-Relations). In RelMiS 2001. Elsevier.Google Scholar
- Roberto Bruni, Hernán C. Melgratti, and Ugo Montanari. 2011. A Connector Algebra for P/T Nets Interactions. In CONCUR 2011. 312–326. Google Scholar
Digital Library
- Roberto Bruni, Hernán C. Melgratti, Ugo Montanari, and Paweł Sobociński. 2013. Connector Algebras for C/E and P/T Nets’ Interactions. Log Meth Comput Sci 9, 16 (2013).Google Scholar
- Aurelio Carboni and R. F. C. Walters. 1987. Cartesian Bicategories I. J Pure Appl Algebra 49 (1987), 11–32.Google Scholar
Cross Ref
- Bob Coecke and Ross Duncan. 2011. Interacting quantum observables: categorical algebra and diagrammatics. New Journal of Physics 13, 4 (2011), 043016.Google Scholar
Cross Ref
- Bob Coecke and Aleks Kissinger. 2017. Picturing Quantum Processes - A first course in Quantum Theory and Diagrammatic Reasoning. Cambridge University Press.Google Scholar
- Bob Coecke, Dusko Pavlovic, and Jamie Vicary. 2012. A new description of orthogonal bases. Math. Struct. Comp. Sci. 23, 3 (2012), 557–567.Google Scholar
- Brendan Coya and Brendan Fong. 2017. Corelations are the prop for extraspecial commutative Frobenius monoids. Theory and Applications of Categories 32, 11 (2017), 380–395.Google Scholar
- Leonard Eugene Dickson. 1913. Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors. American Journal of Mathematics 35, 4 (1913), 413–422.Google Scholar
Cross Ref
- Brendan Fong, Paolo Rapisarda, and Paweł Sobociński. 2016. A categorical approach to open and interconnected dynamical systems. In LICS 2016. Google Scholar
Digital Library
- Naohiko Hoshino, Koko Muroya, and Ichiro Hasuo. 2014. Memoryful geometry of interaction: from coalgebraic components to algebraic effects. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). ACM, 52. Google Scholar
Digital Library
- P Katis, N Sabadini, and RFC Walters. 1997. Bicategories of processes. Journal of Pure and Applied Algebra 115, 2 (1997), 141–178.Google Scholar
Cross Ref
- Joachim Kock. 2003. Frobenius algebras and 2D topological quantum field theories. CUP.Google Scholar
- Stephen Lack. 2004. Composing PROPs. Theory and Application of Categories 13, 9 (2004), 147–163.Google Scholar
- Samuel J Mason. 1953. Feedback Theory: I. Some Properties of Signal Flow Graphs. MIT Research Laboratory of Electronics.Google Scholar
- Antoni Mazurkiewicz. 1987. Compositional semantics of pure place/transition systems. In European Workshop on Applications and Theory in Petri Nets. Springer, 307–330.Google Scholar
- Mogens Nielsen, Lutz Priese, and Vladimiro Sassone. 1995. Characterizing behavioural congruences for Petri nets. In International Conference on Concurrency Theory. Springer, 175–189. Google Scholar
Digital Library
- Mogens Nielsen, Vladimiro Sassone, and Glynn Winskel. 1993. Relationships Between Models of Concurrency. In A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium, Noordwijkerhout, The Netherlands, June 1-4, 1993, Proceedings. 425–476. Google Scholar
Digital Library
- Wolfgang Reisig. 2009. Simple composition of nets. In International Conference on Applications and Theory of Petri Nets. Springer, 23–42. Google Scholar
Digital Library
- Peter Selinger. 2011. A survey of graphical languages for monoidal categories. Springer Lecture Notes in Physics 13, 813 (2011), 289–355.Google Scholar
- Claude E. Shannon. 1942. The Theory and Design of Linear Differential Equation Machines. Technical Report. National Defence Research Council.Google Scholar
- Rob J van Glabbeek. 1990. The linear time-branching time spectrum. In International Conference on Concurrency Theory. Springer, 278–297. Google Scholar
Digital Library
- Jan C Willems. 2007. The behavioural approach to open and interconnected systems. IEEE Contr. Syst. Mag. 27 (2007), 46–99.Google Scholar
Cross Ref
- Fabio Zanasi. 2015. Interacting Hopf Algebras: the theory of linear systems. Ph.D. Dissertation. Ecole Normale Supérieure de Lyon.Google Scholar
- Fabio Zanasi. 2016. The Algebra of Partial Equivalence Relations, In Mathematical Foundations of Program Semantics (MFPS). Electr. Notes Theor. Comput. Sci. 325 (2016), 313–333.Google Scholar
Cross Ref
Index Terms
Diagrammatic algebra: from linear to concurrent systems
Recommendations
Rasiowa-Sikorski deduction systems in computer science applications
A Rasiowa-Sikorski system is a sequence-type formalization of logics. The system uses invertible decomposition rules which decompose a formula into sequences of simpler formulae whose validity is equivalent to validity of the original formula. There may ...
Linear and affine logics with temporal, spatial and epistemic operators
A temporal spatial epistemic intuitionistic linear logic (TSEILL) is introduced, and the completeness theorem for this logic is proved with respect to Kripke semantics. TSEILL has three temporal modal operators: [F] (any time in the future), [N] (next ...
Completeness and decidability of converse PDL in the constructive type theory of Coq
CPP 2018: Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and ProofsThe completeness proofs for Propositional Dynamic Logic (PDL) in the literature are non-constructive and usually presented in an informal manner. We obtain a formal and constructive completeness proof for Converse PDL by recasting a completeness proof ...






Comments