Contextual Equivalence for Signal Flow Graphs
Logic in Computer Science
2020-02-21 v1 Programming Languages
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.
Cite
@article{arxiv.2002.08874,
title = {Contextual Equivalence for Signal Flow Graphs},
author = {Filippo Bonchi and Robin Piedeleu and Pawel Sobocinski and Fabio Zanasi},
journal= {arXiv preprint arXiv:2002.08874},
year = {2020}
}
Comments
Accepted for publication in the proceedings of the 23rd International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2020)