Author:
Bonchi Filippo,Piedeleu Robin,Sobociński Paweł,Zanasi Fabio
Abstract
AbstractWe extend the signal flow calculus—a compositional account of the classical signal flow graph model of computation—to encompass affine behaviour, and furnish it with a novel operational semantics. The increased expressive power allows us to define a canonical notion of contextual equivalence, which we show to coincide with denotational equality. Finally, we characterise the realisable fragment of the calculus: those terms that express the computations of (affine) signal flow graphs.
Publisher
Springer International Publishing
Reference33 articles.
1. Abramsky, S., Coecke, B.: A categorical semantics of quantum protocols. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS), 2004. pp. 415–425. IEEE (2004)
2. Baez, J., Erbele, J.: Categories in control. Theory and Applications of Categories 30, 836–881 (2015)
3. Baez, J.C.: Network theory (2014), http://math.ucr.edu/home/baez/networks/, website (retrieved 15/04/2014)
4. Basold, H., Bonsangue, M., Hansen, H., Rutten, J.: (Co)Algebraic characterizations of signal flow graphs. In: van Breugel, F., Kashefi, E., Palamidessi, C., Rutten, J. (eds.) Horizons of the Mind. A Tribute to Prakash Panangaden, Lecture Notes in Computer Science, vol. 8464, pp. 124–145. Springer International Publishing (2014)
5. Bonchi, F., Holland, J., Piedeleu, R., Sobociński, P., Zanasi, F.: Diagrammatic algebra: from linear to concurrent systems. Proceedings of the 46th ACM SIGPLAN Symposium on Principles of Programming Languages (POPL) 3, 1–28 (2019)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Relational Machine Calculus;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08
2. Kindergarden quantum mechanics graduates ...or how I learned to stop gluing LEGO together and love the ZX-calculus;Theoretical Computer Science;2022-01
3. A Survey of Compositional Signal Flow Theory;IFIP Advances in Information and Communication Technology;2021