Full abstraction for signal flow graphs
Full abstraction for signal flow graphs
Network theory uses the string diagrammatic language of monoidal categories to study graphical structures formally, eschewing specialised translations into intermediate formalisms. Recently, there has been a concerted research focus on developing a network theoretic approach to signal flow graphs, which are classical structures in control theory, signal processing and a cornerstone in the study of feedback. In this approach, signal flow graphs are given a relational denotational semantics in terms of formal power series.
Thus far, the operational behaviour of such signal flow graphs has only been discussed at an intuitive level. In this paper we equip them with a structural operational semantics. As is typically the case, the purely operational picture is too concrete -- two graphs that are denotationally equal may exhibit different operational behaviour. We classify the ways in which this can occur and show that any graph can be realised -- rewritten, using the graphical theory, into an executable form where the operational behavior and the denotation coincides.
515-526
Association for Computing Machinery
Bonchi, Filippo
3c53e89d-d280-4911-9938-eb861553d04e
Sobocinski, Pawel
439334ab-2826-447b-9fe5-3928be3fd4fd
Zanasi, Fabio
5bc03cd7-0fb6-4e14-bae8-8bf0d5d4be38
14 January 2015
Bonchi, Filippo
3c53e89d-d280-4911-9938-eb861553d04e
Sobocinski, Pawel
439334ab-2826-447b-9fe5-3928be3fd4fd
Zanasi, Fabio
5bc03cd7-0fb6-4e14-bae8-8bf0d5d4be38
Bonchi, Filippo, Sobocinski, Pawel and Zanasi, Fabio
(2015)
Full abstraction for signal flow graphs.
In Conference Record of the Annual ACM Symposium on Principles of Programming Languages.
Association for Computing Machinery.
.
(doi:10.1145/2676726.2676993).
Record type:
Conference or Workshop Item
(Paper)
Abstract
Network theory uses the string diagrammatic language of monoidal categories to study graphical structures formally, eschewing specialised translations into intermediate formalisms. Recently, there has been a concerted research focus on developing a network theoretic approach to signal flow graphs, which are classical structures in control theory, signal processing and a cornerstone in the study of feedback. In this approach, signal flow graphs are given a relational denotational semantics in terms of formal power series.
Thus far, the operational behaviour of such signal flow graphs has only been discussed at an intuitive level. In this paper we equip them with a structural operational semantics. As is typically the case, the purely operational picture is too concrete -- two graphs that are denotationally equal may exhibit different operational behaviour. We classify the ways in which this can occur and show that any graph can be realised -- rewritten, using the graphical theory, into an executable form where the operational behavior and the denotation coincides.
Text
__soton.ac.uk_UDE_PersonalFiles_Users_skr1c15_mydocuments_eprints_ECS_Sobocinski_Full Abstraction for Signal flow Graphs1.pdf
- Other
Restricted to Repository staff only
Request a copy
More information
e-pub ahead of print date: 14 January 2015
Published date: 14 January 2015
Venue - Dates:
POPL '15: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Mumbai, India, 2015-01-12 - 2015-01-18
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 396535
URI: http://eprints.soton.ac.uk/id/eprint/396535
ISSN: 0730-8566
PURE UUID: 2d47fd9f-d280-4b6c-b6a6-7ffc9804291e
Catalogue record
Date deposited: 08 Jun 2016 15:52
Last modified: 16 Mar 2024 05:51
Export record
Altmetrics
Contributors
Author:
Filippo Bonchi
Author:
Pawel Sobocinski
Author:
Fabio Zanasi
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics