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.
Bonchi F., Piedeleu R., Sobocinski P., Zanasi F. (2020). Contextual Equivalence for Signal Flow Graphs. GEWERBESTRASSE 11, CHAM : Springer [10.1007/978-3-030-45231-5_5].
Contextual Equivalence for Signal Flow Graphs
Zanasi F.
2020
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.| File | Dimensione | Formato | |
|---|---|---|---|
|
978-3-030-45231-5_5.pdf
accesso aperto
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione
373.27 kB
Formato
Adobe PDF
|
373.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
