Bonchi, F;
Piedeleu, R;
Sobocinski, P;
Zanasi, F;
(2020)
Contextual Equivalence for Signal Flow Graphs.
In: Goubault-Larrecq, J and König, B, (eds.)
Foundations of Software Science and Computation Structures.
(pp. pp. 77-96).
Springer: Cham, Switzerland.
Preview |
Text
Zanasi_Bonchi2020_Chapter_ContextualEquivalenceForSignal.pdf - Published Version Download (5MB) | Preview |
Abstract
We 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.
Type: | Proceedings paper |
---|---|
Title: | Contextual Equivalence for Signal Flow Graphs |
Event: | 23rd International Conference, FOSSACS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25–30, 2020 |
ISBN-13: | 978-3-030-45230-8 |
Open access status: | An open access version is available from UCL Discovery |
DOI: | 10.1007/978-3-030-45231-5_5 |
Publisher version: | https://doi.org/10.1007/978-3-030-45231-5_5 |
Language: | English |
Additional information: | © The Author(s) 2020 Open Access This chapter is licensed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made. The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. |
Keywords: | signal flow graphs, affine relations, full abstraction, contextual equivalence, string diagrams |
UCL classification: | UCL UCL > Provost and Vice Provost Offices > UCL BEAMS UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science |
URI: | https://discovery.ucl.ac.uk/id/eprint/10096986 |



1. | ![]() | 11 |
2. | ![]() | 2 |
3. | ![]() | 1 |
4. | ![]() | 1 |
5. | ![]() | 1 |
6. | ![]() | 1 |
7. | ![]() | 1 |
Archive Staff Only
![]() |
View Item |