Contextual Equivalence for Signal Flow Graphs

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...

Descripción completa

Detalles Bibliográficos
Autores principales: Bonchi, Filippo, Piedeleu, Robin, Sobociński, Paweł, Zanasi, Fabio
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788617/
http://dx.doi.org/10.1007/978-3-030-45231-5_5
_version_ 1783633065070821376
author Bonchi, Filippo
Piedeleu, Robin
Sobociński, Paweł
Zanasi, Fabio
author_facet Bonchi, Filippo
Piedeleu, Robin
Sobociński, Paweł
Zanasi, Fabio
author_sort Bonchi, Filippo
collection PubMed
description 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.
format Online
Article
Text
id pubmed-7788617
institution National Center for Biotechnology Information
language English
publishDate 2020
record_format MEDLINE/PubMed
spelling pubmed-77886172021-01-07 Contextual Equivalence for Signal Flow Graphs Bonchi, Filippo Piedeleu, Robin Sobociński, Paweł Zanasi, Fabio Foundations of Software Science and Computation Structures Article 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. 2020-04-17 /pmc/articles/PMC7788617/ http://dx.doi.org/10.1007/978-3-030-45231-5_5 Text en © 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.
spellingShingle Article
Bonchi, Filippo
Piedeleu, Robin
Sobociński, Paweł
Zanasi, Fabio
Contextual Equivalence for Signal Flow Graphs
title Contextual Equivalence for Signal Flow Graphs
title_full Contextual Equivalence for Signal Flow Graphs
title_fullStr Contextual Equivalence for Signal Flow Graphs
title_full_unstemmed Contextual Equivalence for Signal Flow Graphs
title_short Contextual Equivalence for Signal Flow Graphs
title_sort contextual equivalence for signal flow graphs
topic Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7788617/
http://dx.doi.org/10.1007/978-3-030-45231-5_5
work_keys_str_mv AT bonchifilippo contextualequivalenceforsignalflowgraphs
AT piedeleurobin contextualequivalenceforsignalflowgraphs
AT sobocinskipaweł contextualequivalenceforsignalflowgraphs
AT zanasifabio contextualequivalenceforsignalflowgraphs

Ejemplares similares