Skip to main content
Conference ProceedingsOPEN ACCESS

Contextual Equivalence for Signal Flow Graphs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2020) 12077 LNCS 77-96
DOI: 10.1007/978-3-030-45231-5_5
1Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Bonchi, F., Piedeleu, R., Sobociński, P., & Zanasi, F. (2020). Contextual Equivalence for Signal Flow Graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 12077 LNCS, pp. 77–96). Springer. https://doi.org/10.1007/978-3-030-45231-5_5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free