The Experts below are selected from a list of 213 Experts worldwide ranked by ideXlab platform
Fabio Zanasi - One of the best experts on this subject based on the ideXlab platform.
-
FoSSaCS - Contextual Equivalence for Signal Flow Graphs
Lecture Notes in Computer Science, 2020Co-Authors: Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio ZanasiAbstract: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.
-
Contextual Equivalence for Signal Flow Graphs.
arXiv: Logic in Computer Science, 2020Co-Authors: Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio ZanasiAbstract: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.
-
The Calculus of Signal Flow Diagrams I
Information and Computation, 2017Co-Authors: Filippo Bonchi, Pawel Sobocinski, Fabio ZanasiAbstract:We introduce a graphical syntax for Signal Flow diagrams based on the language of symmetric monoidal categories. Using universal categorical constructions, we provide a stream semantics and a sound and complete axiomatisation.A certain class of diagrams captures the orthodox notion of Signal Flow graph used in control theory; we show that any diagram of our syntax can be realised, via rewriting in the equational theory, as a Signal Flow graph.
-
Full Abstraction for Signal Flow Graphs
2015Co-Authors: Filippo Bonchi, Fabio Zanasi, Pawel SobocinskiAbstract: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.
-
POPL - Full Abstraction for Signal Flow Graphs
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Filippo Bonchi, Pawel Sobocinski, Fabio ZanasiAbstract: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.
Edvaldo Assunção - One of the best experts on this subject based on the ideXlab platform.
-
Signal-Flow graphs: direct method of reduction and MATLAB implementation
IEEE Transactions on Education, 2001Co-Authors: Marcelo C. M. Teixeira, H.f. Marchesi, Edvaldo AssunçãoAbstract:Block diagrams and Signal-Flow graphs are used to represent and to obtain the transfer function of interconnected systems. The reduction of Signal-Flow graphs is considered simpler than the reduction of block diagrams for systems with complex interrelationships. Signal-Flow graphs reduction can be made without graphic manipulations of diagrams, and it is attractive for a computational implementation. In this paper, the authors propose a computational method for direct reduction of Signal-Flow graphs. This method uses results presented in this paper about the calculation of literal determinants without symbolic mathematics tools. The Cramer's rule is applied for the solution of a set of linear equations. A program in MATLAB language for reduction of Signal-Flow graphs with the proposed method is presented.
Bradley S. Tice - One of the best experts on this subject based on the ideXlab platform.
-
Feedback Systems for Nontraditional Medicines: A Case for the Signal Flow Diagram
Journal of pharmaceutical sciences, 1998Co-Authors: Bradley S. TiceAbstract:The Signal Flow diagram is a graphic method used to represent complex data that is found in the field of biology and hence the field of medicine. The Signal Flow diagram is analyzed against a table of data and a Flow chart of data and evaluated on the clarity and simplicity of imparting this information. The data modeled is from previous clinical studies and nontraditional medicine from Africa, China, and South America. This report is a development from previous presentations of the Signal Flow diagram.1−4
Filippo Bonchi - One of the best experts on this subject based on the ideXlab platform.
-
FoSSaCS - Contextual Equivalence for Signal Flow Graphs
Lecture Notes in Computer Science, 2020Co-Authors: Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio ZanasiAbstract: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.
-
Contextual Equivalence for Signal Flow Graphs.
arXiv: Logic in Computer Science, 2020Co-Authors: Filippo Bonchi, Robin Piedeleu, Pawel Sobocinski, Fabio ZanasiAbstract: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.
-
The Calculus of Signal Flow Diagrams I
Information and Computation, 2017Co-Authors: Filippo Bonchi, Pawel Sobocinski, Fabio ZanasiAbstract:We introduce a graphical syntax for Signal Flow diagrams based on the language of symmetric monoidal categories. Using universal categorical constructions, we provide a stream semantics and a sound and complete axiomatisation.A certain class of diagrams captures the orthodox notion of Signal Flow graph used in control theory; we show that any diagram of our syntax can be realised, via rewriting in the equational theory, as a Signal Flow graph.
-
Full Abstraction for Signal Flow Graphs
2015Co-Authors: Filippo Bonchi, Fabio Zanasi, Pawel SobocinskiAbstract: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.
-
POPL - Full Abstraction for Signal Flow Graphs
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015Co-Authors: Filippo Bonchi, Pawel Sobocinski, Fabio ZanasiAbstract: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.
J.a. Hegt - One of the best experts on this subject based on the ideXlab platform.
-
Signal Flow graph based synthesis of strays-insensitive switched-capacitor filters
IEEE International Symposium on Circuits and Systems, 1Co-Authors: J.a. HegtAbstract:An algorithmic method of designing biphase-clocked strays-insensitive switched-capacitor filters is presented. The desired transfer function is mapped on a general Signal-Flow graph, which is composed of branches that represent the Signal Flow in elementary strays-insensitive switched-capacitor structures. Translating this type of graph into switched-capacitor filters yields circuits with a number of attractive properties. >
