Contextual Equivalence for Signal Flow Graphs
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.
- Publication:
-
arXiv e-prints
- Pub Date:
- February 2020
- DOI:
- 10.48550/arXiv.2002.08874
- arXiv:
- arXiv:2002.08874
- Bibcode:
- 2020arXiv200208874B
- Keywords:
-
- Computer Science - Logic in Computer Science;
- Computer Science - Programming Languages
- E-Print:
- Accepted for publication in the proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2020)