Signal-flow graph

<h2 id="history">History</h2>
Wai-Kai Chen wrote: "The concept of a signal-flow graph was originally worked out by <a href="/facts/Claude_Shannon/EremsCws">Shannon</a> [1942]<a class="footnote-ref" id="fnref:5" href="#fn:5">5</a> 
in dealing with analog computers. The greatest credit for the formulation of signal-flow graphs is normally extended to <a href="/facts/Samuel_Jefferson_Mason/PfIReDmH">Mason</a> [1953],<a class="footnote-ref" id="fnref:6" href="#fn:6">6</a> [1956].<a class="footnote-ref" id="fnref:7" href="#fn:7">7</a> He showed how to use the signal-flow graph technique to solve some difficult electronic problems in a relatively simple manner. The term signal flow graph was used because of its original application to electronic problems and the association with electronic signals and flowcharts of the systems under study."<a class="footnote-ref" id="fnref:8" href="#fn:8">8</a>
Lorens wrote: "Previous to <a href="/facts/Samuel_Jefferson_Mason/PfIReDmH">Mason</a>'s work, <a href="/facts/Claude_Shannon/EremsCws">C. E. Shannon</a><a class="footnote-ref" id="fnref:9" href="#fn:9">9</a> worked out a number of the properties of what are now known as flow graphs. Unfortunately, the paper originally had a restricted classification and very few people had access to the material."<a class="footnote-ref" id="fnref:10" href="#fn:10">10</a>
"The rules for the evaluation of the graph determinant of a Mason Graph were first given and proven by Shannon [1942] using mathematical induction. His work remained essentially unknown even after Mason published his classical work in 1953. Three years later, Mason [1956] rediscovered the rules and proved them by considering the value of a determinant and how it changes as variables are added to the graph. [...]"<a class="footnote-ref" id="fnref:11" href="#fn:11">11</a>

<h2 id="domain-of-application">Domain of application</h2>
Robichaud et al. identify the domain of application of SFGs as follows:<a class="footnote-ref" id="fnref:12" href="#fn:12">12</a>

"All the physical systems analogous to these networks [constructed of ideal transformers, active elements and gyrators] constitute the domain of application of the techniques developed [here]. Trent<a class="footnote-ref" id="fnref:13" href="#fn:13">13</a> has shown that all the physical systems which satisfy the following conditions fall into this category.
<ol><li>The finite lumped system is composed of a number of simple parts, each of which has known dynamical properties which can be defined by equations using two types of scalar variables and parameters of the system. Variables of the first type represent quantities which can be measured, at least conceptually, by attaching an indicating instrument to two connection points of the element. Variables of the second type characterize quantities which can be measured by connecting a meter in series with the element. Relative velocities and positions, pressure differentials and voltages are typical quantities of the first class, whereas electric currents, forces, rates of heat flow, are variables of the second type. Firestone has been the first to distinguish these two types of variables with the names across variables and through variables.</li>
<li>Variables of the first type must obey a mesh law, analogous to Kirchhoff's voltage law, whereas variables of the second type must satisfy an incidence law analogous to Kirchhoff's current law.</li>
<li>Physical dimensions of appropriate products of the variables of the two types must be consistent. For the systems in which these conditions are satisfied, it is possible to draw a linear graph isomorphic with the dynamical properties of the system as described by the chosen variables. The techniques [...] can be applied directly to these linear graphs as well as to electrical networks, to obtain a signal flow graph of the system."</li></ol>
<h2 id="basic-flow-graph-concepts">Basic flow graph concepts</h2>
The following illustration and its meaning were introduced by Mason to illustrate basic concepts:<a class="footnote-ref" id="fnref:14" href="#fn:14">14</a>

In the simple flow graphs of the figure, a functional dependence of a node is indicated by an incoming arrow, the node originating this influence is the beginning of this arrow, and in its most general form the signal flow graph indicates by incoming arrows only those nodes that influence the processing at the receiving node, and at each node, i, the incoming variables are processed according to a function associated with that node, say Fi. The flowgraph in (a) represents a set of explicit relationships:

x
                  
                    
                      1
                    
                  
                
              
              
                
                =
                
                  an independent variable
                
              
            
            
              
                
                  x
                  
                    
                      2
                    
                  
                
              
              
                
                =
                
                  F
                  
                    2
                  
                
                (
                
                  x
                  
                    
                      1
                    
                  
                
                ,
                
                  x
                  
                    
                      3
                    
                  
                
                )
              
            
            
              
                
                  x
                  
                    
                      3
                    
                  
                
              
              
                
                =
                
                  F
                  
                    3
                  
                
                (
                
                  x
                  
                    
                      1
                    
                  
                
                ,
                
                  x
                  
                    
                      2
                    
                  
                
                ,
                
                  x
                  
                    
                      3
                    
                  
                
                )
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}x_{\mathrm {1} }&={\text{an independent variable}}\\x_{\mathrm {2} }&=F_{2}(x_{\mathrm {1} },x_{\mathrm {3} })\\x_{\mathrm {3} }&=F_{3}(x_{\mathrm {1} },x_{\mathrm {2} },x_{\mathrm {3} })\\\end{aligned}}}

Node x1 is an isolated node because no arrow is incoming; the equations for x2 and x3 have the graphs shown in parts (b) and (c) of the figure.
These relationships define for every node a function that processes the input signals it receives. Each non-source node combines the input signals in some manner, and broadcasts a resulting signal along each outgoing branch. "A flow graph, as defined originally by Mason, implies a set of functional relations, linear or not."<a class="footnote-ref" id="fnref:15" href="#fn:15">15</a>
However, the commonly used Mason graph is more restricted, assuming that each node simply sums its incoming arrows, and that each branch involves only the initiating node involved. Thus, in this more restrictive approach, the node x1 is unaffected while:

x
          
            2
          
        
        =
        
          f
          
            21
          
        
        (
        
          x
          
            1
          
        
        )
        +
        
          f
          
            23
          
        
        (
        
          x
          
            3
          
        
        )
      
    
    {\displaystyle x_{2}=f_{21}(x_{1})+f_{23}(x_{3})}

x
          
            3
          
        
        =
        
          f
          
            31
          
        
        (
        
          x
          
            1
          
        
        )
        +
        
          f
          
            32
          
        
        (
        
          x
          
            2
          
        
        )
        +
        
          f
          
            33
          
        
        (
        
          x
          
            3
          
        
        )
         
        ,
      
    
    {\displaystyle x_{3}=f_{31}(x_{1})+f_{32}(x_{2})+f_{33}(x_{3})\ ,}

and now the functions fij can be associated with the signal-flow branches ij joining the pair of nodes xi, xj, rather than having general relationships associated with each node. A contribution by a node to itself like f33 for x3 is called a self-loop. Frequently these functions are simply multiplicative factors (often called transmittances or gains), for example, fij(xj)=cijxj, where c is a scalar, but possibly a function of some parameter like the Laplace transform variable s. Signal-flow graphs are very often used with Laplace-transformed signals, because then they represent systems of <a href="/facts/Linear_differential_equation/nLEbIIVf">Linear differential equations</a>. In this case the transmittance, c(s), often is called a <a href="/facts/Transfer_function/slDsh1lH">transfer function</a>.

<h3>Choosing the variables</h3>
<blockquote>In general, there are several ways of choosing the variables in a complex system. Corresponding to each choice, a <a href="/facts/System_of_equations/KzP6TJ4u">system of equations</a> can be written and each system of equations can be represented in a graph. This formulation of the equations becomes direct and automatic if one has at his disposal techniques which permit the drawing of a graph directly from the <a href="/facts/Schematic_diagram/E5UaFSoc">schematic diagram</a> of the system under study. The structure of the graphs thus obtained is related in a simple manner to the <a href="/facts/Topology/2EqW47cU">topology</a> of the <a href="/facts/Schematic_diagram/E5UaFSoc">schematic diagram</a>, and it becomes unnecessary to consider the <a href="/facts/Equations/pxFzLAVR">equations</a>, even implicitly, to obtain the graph. In some cases, one has simply to imagine the flow graph in the schematic diagram and the desired answers can be obtained without even drawing the flow graph.— Robichaud<a class="footnote-ref" id="fnref:16" href="#fn:16">16</a></blockquote>
<h3>Non-uniqueness</h3>
Robichaud et al. wrote: "The signal flow graph contains the same information as the equations from which it is derived; but there does not exist a one-to-one correspondence between the graph and the system of equations. One system will give different graphs according to the order in which the equations are used to define the variable written on the left-hand side."<a class="footnote-ref" id="fnref:17" href="#fn:17">17</a> If all equations relate all dependent variables, then there are n! possible SFGs to choose from.<a class="footnote-ref" id="fnref:18" href="#fn:18">18</a>

<h2 id="linear-signal-flow-graphs">Linear signal-flow graphs</h2>
Linear signal-flow graph (SFG) methods only apply to <a href="/facts/Linear_time-invariant_system/kEmj0QDC">linear time-invariant systems</a>, as studied by <a href="/facts/LTI_system_theory/kEmj0QDC">their associated theory</a>. When modeling a system of interest, the first step is often to determine the equations representing the system's operation without assigning causes and effects (this is called acausal modeling).<a class="footnote-ref" id="fnref:19" href="#fn:19">19</a> A SFG is then derived from this system of equations.
A linear SFG consists of nodes indicated by dots and weighted directional branches indicated by arrows. The nodes are the variables of the <a href="/facts/System_of_linear_equations/fk9CFdgp">equations</a> and the branch weights are the coefficients. Signals may only traverse a branch in the direction indicated by its arrow. The elements of a SFG can only represent the operations of multiplication by a coefficient and addition, which are sufficient to represent the constrained equations. When a signal traverses a branch in its indicated direction, the signal is multiplied the weight of the branch. When two or more branches direct into the same node, their outputs are added.
For systems described by linear algebraic or differential equations, the signal-flow graph is mathematically equivalent to the system of equations describing the system, and the equations governing the nodes are discovered for each node by summing incoming branches to that node. These incoming branches convey the contributions of the other nodes, expressed as the connected node value multiplied by the weight of the connecting branch, usually a real number or function of some parameter (for example a <a href="/facts/Laplace_transform/0Ge4MIc9">Laplace transform</a> variable s).
For linear active networks, Choma writes:<a class="footnote-ref" id="fnref:20" href="#fn:20">20</a> "By a 'signal flow representation' [or 'graph', as it is commonly referred to] we mean a diagram that, by displaying the algebraic relationships among relevant branch variables of network, paints an unambiguous picture of the way an applied input signal ‘flows’ from input-to-output ... ports."
A motivation for a SFG analysis is described by Chen:<a class="footnote-ref" id="fnref:21" href="#fn:21">21</a>

"The analysis of a linear system reduces ultimately to the solution of a system of linear algebraic equations. As an alternative to conventional algebraic methods of solving the system, it is possible to obtain a solution by considering the properties of certain directed graphs associated with the system." [See subsection: Solving linear equations.] "The unknowns of the equations correspond to the nodes of the graph, while the linear relations between them appear in the form of directed edges connecting the nodes. ...The associated directed graphs in many cases can be set up directly by inspection of the physical system without the necessity of first formulating the →associated equations..."
<h3>Basic components</h3>

A linear signal flow graph is related to a system of linear equations<a class="footnote-ref" id="fnref:22" href="#fn:22">22</a> of the following form:

x
                  
                    
                      j
                    
                  
                
              
              
                
                =
                
                  ∑
                  
                    
                      k
                    
                    =
                    1
                  
                  
                    
                      N
                    
                  
                
                
                  t
                  
                    
                      j
                      k
                    
                  
                
                
                  x
                  
                    
                      k
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}x_{\mathrm {j} }&=\sum _{\mathrm {k} =1}^{\mathrm {N} }t_{\mathrm {jk} }x_{\mathrm {k} }\end{aligned}}}

where 
 
 
 
 
 t
 
 j
 k
 
 
 
 
 {\displaystyle t_{jk}}
 
 = transmittance (or gain) from 
 
 
 
 
 x
 
 k
 
 
 
 
 {\displaystyle x_{k}}
 
 to 
 
 
 
 
 x
 
 j
 
 
 
 
 {\displaystyle x_{j}}
 
.
The figure to the right depicts various elements and constructs of a signal flow graph (SFG).<a class="footnote-ref" id="fnref:23" href="#fn:23">23</a>

Exhibit (a) is a node. In this case, the node is labeled 
 
 
 
 x
 
 
 {\displaystyle x}
 
. A node is a vertex representing a variable or signal.
A source node has only outgoing branches (represents an independent variable). As a special case, an input node is characterized by having one or more attached arrows pointing away from the node and no arrows pointing into the node. Any open, complete SFG will have at least one input node.
An output or sink node has only incoming branches (represents a dependent variable). Although any node can be an output, explicit output nodes are often used to provide clarity. Explicit output nodes are characterized by having one or more attached arrows pointing into the node and no arrows pointing away from the node. Explicit output nodes are not required.
A mixed node has both incoming and outgoing branches.
Exhibit (b) is a branch with a multiplicative gain of 
 
 
 
 m
 
 
 {\displaystyle m}
 
. The meaning is that the output, at the tip of the arrow, is 
 
 
 
 m
 
 
 {\displaystyle m}
 
 times the input at the tail of the arrow. The gain can be a simple constant or a function (for example: a function of some transform variable such as 
 
 
 
 s
 
 
 {\displaystyle s}
 
, 
 
 
 
 ω
 
 
 {\displaystyle \omega }
 
, or 
 
 
 
 z
 
 
 {\displaystyle z}
 
, for Laplace, Fourier or Z-transform relationships).
Exhibit (c) is a branch with a multiplicative gain of one. When the gain is omitted, it is assumed to be unity.
Exhibit (d) 
 
 
 
 
 V
 
 i
 n
 
 
 
 
 {\displaystyle V_{in}}
 
 is an input node. In this case, 
 
 
 
 
 V
 
 i
 n
 
 
 
 
 {\displaystyle V_{in}}
 
 is multiplied by the gain 
 
 
 
 m
 
 
 {\displaystyle m}
 
.
Exhibit (e) 
 
 
 
 
 I
 
 o
 u
 t
 
 
 
 
 {\displaystyle I_{out}}
 
 is an explicit output node; the incoming edge has a gain of 
 
 
 
 m
 
 
 {\displaystyle m}
 
.
Exhibit (f) depicts addition. When two or more arrows point into a node, the signals carried by the edges are added.
Exhibit (g) depicts a simple loop. The loop gain is 
 
 
 
 A
 ×
 m
 
 
 {\displaystyle A\times m}
 
.
Exhibit (h) depicts the expression 
 
 
 
 Z
 =
 a
 X
 +
 b
 Y
 
 
 {\displaystyle Z=aX+bY}
 
.
Terms used in linear SFG theory also include:<a class="footnote-ref" id="fnref:24" href="#fn:24">24</a>

<ul><li>Path. A path is a continuous set of branches traversed in the direction indicated by the branch arrows.
<ul><li>Open path. If no node is re-visited, the path is open.</li>
<li>Forward path. A path from an input node (source) to an output node (sink) that does not re-visit any node.</li></ul></li>
<li>Path gain: the product of the gains of all the branches in the path.</li>
<li>Loop. A closed path. (it originates and ends on the same node, and no node is touched more than once).</li>
<li>Loop gain: the product of the gains of all the branches in the loop.</li>
<li>Non-touching loops. Non-touching loops have no common nodes.</li>
<li>Graph reduction. Removal of one or more nodes from a graph using graph transformations.
<ul><li>Residual node. In any contemplated process of graph reduction, the nodes to be retained in the new graph are called residual nodes.<a class="footnote-ref" id="fnref:25" href="#fn:25">25</a></li></ul></li>
<li>Splitting a node. Splitting a node corresponds to splitting a node into two half nodes, one being a sink and the other a source.<a class="footnote-ref" id="fnref:26" href="#fn:26">26</a></li>
<li>Index: The index of a graph is the minimum number of nodes which have to be split in order to remove all the loops in a graph.
<ul><li>Index node. The nodes that are split to determine the index of a graph are called index nodes, and in general they are not unique.</li></ul></li></ul>
<h3>Systematic reduction to sources and sinks</h3>
A signal-flow graph may be simplified by graph transformation rules.<a class="footnote-ref" id="fnref:27" href="#fn:27">27</a><a class="footnote-ref" id="fnref:28" href="#fn:28">28</a><a class="footnote-ref" id="fnref:29" href="#fn:29">29</a> These simplification rules are also referred to as signal-flow graph algebra.<a class="footnote-ref" id="fnref:30" href="#fn:30">30</a>
The purpose of this reduction is to relate the dependent variables of interest (residual nodes, sinks) to its independent variables (sources).
The systematic reduction of a linear signal-flow graph is a graphical method equivalent to the <a href="/facts/Gaussian_elimination/23Rvf4ht">Gauss-Jordan elimination</a> method for solving linear equations.<a class="footnote-ref" id="fnref:31" href="#fn:31">31</a>
The rules presented below may be applied over and over until the signal flow graph is reduced to its "minimal residual form". Further reduction can require loop elimination or the use of a "reduction formula" with the goal to directly connect sink nodes representing the dependent variables to the source nodes representing the independent variables. By these means, any signal-flow graph can be simplified by successively removing internal nodes until only the input and output and index nodes remain.<a class="footnote-ref" id="fnref:32" href="#fn:32">32</a><a class="footnote-ref" id="fnref:33" href="#fn:33">33</a> Robichaud described this process of systematic flow-graph reduction:

<blockquote>The reduction of a graph proceeds by the elimination of certain nodes to obtain a residual graph showing only the variables of interest. This elimination of nodes is called "node absorption". This method is close to the familiar process of successive eliminations of undesired variables in a system of equations. One can eliminate a variable by removing the corresponding node in the graph. If one reduces the graph sufficiently, it is possible to obtain the solution for any variable and this is the objective which will be kept in mind in this description of the different methods of reduction of the graph. In practice, however, the techniques of reduction will be used solely to transform the graph to a residual graph expressing some fundamental relationships. Complete solutions will be more easily obtained by application of <a href="/facts/Mason%2527s_gain_formula/7GRvcxKG">Mason's rule</a>.<a class="footnote-ref" id="fnref:34" href="#fn:34">34</a>
The graph itself programs the reduction process. Indeed a simple inspection of the graph readily suggests the different steps of the reduction which are carried out by elementary transformations, by loop elimination, or by the use of a reduction formula.<a class="footnote-ref" id="fnref:35" href="#fn:35">35</a>— Robichaud, Signal flow graphs and applications, 1962</blockquote>
For digitally reducing a flow graph using an algorithm, Robichaud extends the notion of a simple flow graph to a generalized flow graph:

<blockquote>Before describing the process of reduction...the correspondence between the graph and a system of linear equations ... must be generalized...The generalized graphs will represent some operational relationships between groups of variables...To each branch of the generalized graph is associated a matrix giving the relationships between the variables represented by the nodes at the extremities of that branch...<a class="footnote-ref" id="fnref:36" href="#fn:36">36</a>
The elementary transformations [defined by Robichaud in his Figure 7.2, p. 184] and the loop reduction permit the elimination of any node j of the graph by the reduction formula:[described in Robichaud's Equation 7-1]. With the reduction formula, it is always possible to reduce a graph of any order... [After reduction] the final graph will be a cascade graph in which the variables of the sink nodes are explicitly expressed as functions of the sources. This is the only method for reducing the generalized graph since Mason's rule is obviously inapplicable.<a class="footnote-ref" id="fnref:37" href="#fn:37">37</a>— Robichaud, Signal flow graphs and applications, 1962</blockquote>
The definition of an elementary transformation varies from author to author:

<ul><li>Some authors only consider as elementary transformations the summation of parallel-edge gains and the multiplication of series-edge gains, but not the elimination of self-loops<a class="footnote-ref" id="fnref:38" href="#fn:38">38</a><a class="footnote-ref" id="fnref:39" href="#fn:39">39</a></li>
<li>Other authors consider the elimination of a self-loop as an elementary transformation<a class="footnote-ref" id="fnref:40" href="#fn:40">40</a></li></ul>
Parallel edges. Replace parallel edges with a single edge having a gain equal to the sum of original gains.

The graph on the left has parallel edges between nodes. On the right, these parallel edges have been replaced with a single edge having a gain equal to the sum of the gains on each original edge.
The equations corresponding to the reduction between N and node I1 are:

N
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                +
                .
                .
                .
              
            
            
              
                N
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                (
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  f
                  
                    
                      3
                    
                  
                
                )
                +
                .
                .
                .
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}N&=I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {1} }f_{\mathrm {2} }+I_{\mathrm {1} }f_{\mathrm {3} }+...\\N&=I_{\mathrm {1} }(f_{\mathrm {1} }+f_{\mathrm {2} }+f_{\mathrm {3} })+...\\\end{aligned}}}

Outflowing edges. Replace outflowing edges with edges directly flowing from the node's sources.

The graph on the left has an intermediate node N between nodes from which it has inflows, and nodes to which it flows out.
The graph on the right shows direct flows between these node sets, without transiting via N.

For the sake of simplicity, N and its inflows are not represented. The outflows from N are eliminated.
The equations corresponding to the reduction directly relating N's input signals to its output signals are:

N
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
              
            
            
              
                
                  O
                  
                    
                      1
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      1
                    
                  
                
                N
              
            
            
              
                
                  O
                  
                    
                      2
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      2
                    
                  
                
                N
              
            
            
              
                
                  O
                  
                    
                      3
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      3
                    
                  
                
                N
              
            
            
              
                
                  O
                  
                    
                      1
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      1
                    
                  
                
                (
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                )
              
            
            
              
                
                  O
                  
                    
                      2
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      2
                    
                  
                
                (
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                )
              
            
            
              
                
                  O
                  
                    
                      3
                    
                  
                
              
              
                
                =
                
                  g
                  
                    
                      3
                    
                  
                
                (
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                )
              
            
            
              
                
                  O
                  
                    
                      1
                    
                  
                
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                
                  g
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                
                  g
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                
                  g
                  
                    
                      1
                    
                  
                
              
            
            
              
                
                  O
                  
                    
                      2
                    
                  
                
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                
                  g
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                
                  g
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                
                  g
                  
                    
                      2
                    
                  
                
              
            
            
              
                
                  O
                  
                    
                      3
                    
                  
                
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                
                  g
                  
                    
                      3
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                
                  g
                  
                    
                      3
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                
                  g
                  
                    
                      3
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}N&=I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} }\\O_{\mathrm {1} }&=g_{\mathrm {1} }N\\O_{\mathrm {2} }&=g_{\mathrm {2} }N\\O_{\mathrm {3} }&=g_{\mathrm {3} }N\\O_{\mathrm {1} }&=g_{\mathrm {1} }(I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} })\\O_{\mathrm {2} }&=g_{\mathrm {2} }(I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} })\\O_{\mathrm {3} }&=g_{\mathrm {3} }(I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} })\\O_{\mathrm {1} }&=I_{\mathrm {1} }f_{\mathrm {1} }g_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }g_{\mathrm {1} }+I_{\mathrm {3} }f_{\mathrm {3} }g_{\mathrm {1} }\\O_{\mathrm {2} }&=I_{\mathrm {1} }f_{\mathrm {1} }g_{\mathrm {2} }+I_{\mathrm {2} }f_{\mathrm {2} }g_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} }g_{\mathrm {2} }\\O_{\mathrm {3} }&=I_{\mathrm {1} }f_{\mathrm {1} }g_{\mathrm {3} }+I_{\mathrm {2} }f_{\mathrm {2} }g_{\mathrm {3} }+I_{\mathrm {3} }f_{\mathrm {3} }g_{\mathrm {3} }\\\end{aligned}}}

Zero-signal nodes.

Eliminate outflowing edges from a node determined to have a value of zero.

If the value of a node is zero, its outflowing edges can be eliminated.
Nodes without outflows.

Eliminate a node without outflows.

In this case, N is not a variable of interest, and it has no outgoing edges; therefore, N, and its inflowing edges, can be eliminated.

Self-looping edge. Replace looping edges by adjusting the gains on the incoming edges.
The graph on the left has a looping edge at node N, with a gain of g. On the right, the looping edge has been eliminated, and all inflowing edges have their gain divided by (1-g).The equations corresponding to the reduction between N and all its input signals are:

N
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                +
                N
                g
              
            
            
              
                N
                −
                N
                g
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
              
            
            
              
                N
                (
                1
                −
                g
                )
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
              
            
            
              
                N
              
              
                
                =
                (
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                )
                ÷
                (
                1
                −
                g
                )
              
            
            
              
                N
              
              
                
                =
                
                  I
                  
                    
                      1
                    
                  
                
                
                  f
                  
                    
                      1
                    
                  
                
                ÷
                (
                1
                −
                g
                )
                +
                
                  I
                  
                    
                      2
                    
                  
                
                
                  f
                  
                    
                      2
                    
                  
                
                ÷
                (
                1
                −
                g
                )
                +
                
                  I
                  
                    
                      3
                    
                  
                
                
                  f
                  
                    
                      3
                    
                  
                
                ÷
                (
                1
                −
                g
                )
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}N&=I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} }+Ng\\N-Ng&=I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} }\\N(1-g)&=I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} }\\N&=(I_{\mathrm {1} }f_{\mathrm {1} }+I_{\mathrm {2} }f_{\mathrm {2} }+I_{\mathrm {3} }f_{\mathrm {3} })\div (1-g)\\N&=I_{\mathrm {1} }f_{\mathrm {1} }\div (1-g)+I_{\mathrm {2} }f_{\mathrm {2} }\div (1-g)+I_{\mathrm {3} }f_{\mathrm {3} }\div (1-g)\\\end{aligned}}}

<h4>Implementations</h4>
The above procedure for building the SFG from an acausal system of equations and for solving the SFG's gains have been implemented<a class="footnote-ref" id="fnref:41" href="#fn:41">41</a> as an add-on to <a href="/facts/MATHLAB_68/j7H2pgGg">MATHLAB 68</a>,<a class="footnote-ref" id="fnref:42" href="#fn:42">42</a> an on-line <a href="/facts/Computer_algebra_system/jkLAC1U3">system providing machine aid for the mechanical symbolic processes encountered in analysis</a>.

<h3>Solving linear equations</h3>
Signal flow graphs can be used to solve sets of simultaneous linear equations.<a class="footnote-ref" id="fnref:43" href="#fn:43">43</a> The set of equations must be consistent and all equations must be linearly independent.

<h4>Putting the equations in "standard form"</h4>

For M equations with N unknowns where each yj is a known value and each xj is an unknown value, there is equation for each known of the following form.

∑
 
 
 k
 
 =
 1
 
 
 
 N
 
 
 
 
 c
 
 
 j
 k
 
 
 
 
 x
 
 
 k
 
 
 
 
 
 
 =
 
 y
 
 
 j
 
 
 
 
 
 
 
 
 
 {\displaystyle {\begin{aligned}\sum _{\mathrm {k} =1}^{\mathrm {N} }c_{\mathrm {jk} }x_{\mathrm {k} }&=y_{\mathrm {j} }\end{aligned}}}
 
 ; the usual form for simultaneous linear equations with 1 ≤ j ≤ M
Although it is feasible, particularly for simple cases, to establish a signal flow graph using the equations in this form, some rearrangement allows a general procedure that works easily for any set of equations, as now is presented. To proceed, first the equations are rewritten as

∑
                  
                    
                      k
                    
                    =
                    1
                  
                  
                    
                      N
                    
                  
                
                
                  c
                  
                    
                      j
                      k
                    
                  
                
                
                  x
                  
                    
                      k
                    
                  
                
                −
                
                  y
                  
                    
                      j
                    
                  
                
              
              
                
                =
                0
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}\sum _{\mathrm {k} =1}^{\mathrm {N} }c_{\mathrm {jk} }x_{\mathrm {k} }-y_{\mathrm {j} }&=0\end{aligned}}}

and further rewritten as

∑
                  
                    
                      k
                      =
                      1
                    
                  
                  
                    
                      N
                    
                  
                
                
                  c
                  
                    
                      j
                      k
                    
                  
                
                
                  x
                  
                    
                      k
                    
                  
                
                +
                
                  x
                  
                    
                      j
                    
                  
                
                −
                
                  y
                  
                    
                      j
                    
                  
                
              
              
                
                =
                
                  x
                  
                    
                      j
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}\sum _{\mathrm {k=1} }^{\mathrm {N} }c_{\mathrm {jk} }x_{\mathrm {k} }+x_{\mathrm {j} }-y_{\mathrm {j} }&=x_{\mathrm {j} }\end{aligned}}}

and finally rewritten as

∑
 
 
 k
 =
 1
 
 
 
 
 N
 
 
 
 (
 
 c
 
 
 j
 k
 
 
 
 +
 
 δ
 
 
 j
 k
 
 
 
 )
 
 x
 
 
 k
 
 
 
 −
 
 y
 
 
 j
 
 
 
 
 
 
 =
 
 x
 
 
 j
 
 
 
 
 
 
 
 
 
 {\displaystyle {\begin{aligned}\sum _{\mathrm {k=1} }^{\mathrm {N} }(c_{\mathrm {jk} }+\delta _{\mathrm {jk} })x_{\mathrm {k} }-y_{\mathrm {j} }&=x_{\mathrm {j} }\end{aligned}}}
 
  ; form suitable to be expressed as a signal flow graph.
where δkj = <a href="/facts/Kronecker_delta/gcGAy0bm">Kronecker delta</a>
The signal-flow graph is now arranged by selecting one of these equations and addressing the node on the right-hand side. This is the node for which the node connects to itself with the branch of weight including a '+1', making a self-loop in the flow graph. The other terms in that equation connect this node first to the source in this equation and then to all the other branches incident on this node. Every equation is treated this way, and then each incident branch is joined to its respective emanating node. For example, the case of three variables is shown in the figure, and the first equation is:

x
          
            1
          
        
        =
        
          (
          
            
              c
              
                11
              
            
            +
            1
          
          )
        
        
          x
          
            1
          
        
        +
        
          c
          
            12
          
        
        
          x
          
            2
          
        
        +
        
          c
          
            13
          
        
        
          x
          
            3
          
        
        −
        
          y
          
            1
          
        
         
        ,
      
    
    {\displaystyle x_{1}=\left(c_{11}+1\right)x_{1}+c_{12}x_{2}+c_{13}x_{3}-y_{1}\ ,}

where the right side of this equation is the sum of the weighted arrows incident on node x1.
As there is a basic symmetry in the treatment of every node, a simple starting point is an arrangement of nodes with each node at one vertex of a regular polygon. When expressed using the general coefficients {cin}, the environment of each node is then just like all the rest apart from a permutation of indices. Such an implementation for a set of three simultaneous equations is seen in the figure.<a class="footnote-ref" id="fnref:44" href="#fn:44">44</a>
Often the known values, yj are taken as the primary causes and the unknowns values, xj to be effects, but regardless of this interpretation, the last form for the set of equations can be represented as a signal-flow graph. This point is discussed further in the subsection Interpreting 'causality'.

<h4>Applying Mason's gain formula</h4>
Further information: <a href="/facts/Mason%2527s_gain_formula/7GRvcxKG">Mason's gain formula</a>
In the most general case, the values for all the xk variables can be calculated by computing Mason's gain formula for the path from each yj to each xk and using superposition.

x
                  
                    
                      k
                    
                  
                
              
              
                
                =
                
                  ∑
                  
                    
                      j
                    
                    =
                    1
                  
                  
                    
                      M
                    
                  
                
                (
                
                  G
                  
                    
                      k
                      j
                    
                  
                
                )
                
                  y
                  
                    
                      j
                    
                  
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}x_{\mathrm {k} }&=\sum _{\mathrm {j} =1}^{\mathrm {M} }(G_{\mathrm {kj} })y_{\mathrm {j} }\end{aligned}}}

where Gkj = the sum of Mason's gain formula computed for all the paths from input yj to variable xk.
In general, there are N-1 paths from yj to variable xk so the computational effort to calculated Gkj is proportional to N-1.
Since there are M values of yj, Gkj must be computed M times for a single value of xk. The computational effort to calculate a single xk variable is proportional to (N-1)(M). The effort to compute all the xk variables is proportional to (N)(N-1)(M). If there are N equations and N unknowns, then the computation effort is on the order of N3.

<h2 id="relation-to-block-diagrams">Relation to block diagrams</h2>

For some authors, a linear signal-flow graph is more constrained than a <a href="/facts/Block_diagram/PljzAqq6">block diagram</a>,<a class="footnote-ref" id="fnref:45" href="#fn:45">45</a> in that the SFG rigorously describes linear algebraic equations represented by a directed graph.
For other authors, linear block diagrams and linear signal-flow graphs are equivalent ways of depicting a system, and either can be used to solve the gain.<a class="footnote-ref" id="fnref:46" href="#fn:46">46</a>
A tabulation of the comparison between block diagrams and signal-flow graphs is provided by Bakshi & Bakshi,<a class="footnote-ref" id="fnref:47" href="#fn:47">47</a> and another tabulation by Kumar.<a class="footnote-ref" id="fnref:48" href="#fn:48">48</a> According to Barker et al.:<a class="footnote-ref" id="fnref:49" href="#fn:49">49</a>

"The signal flow graph is the most convenient method for representing a dynamic system. The topology of the graph is compact and the rules for manipulating it are easier to program than the corresponding rules that apply to block diagrams."
In the figure, a simple block diagram for a <a href="/facts/Feedback/XnuWH3zp">feedback</a> system is shown with two possible interpretations as a signal-flow graph. The input R(s) is the Laplace-transformed input signal; it is shown as a source node in the signal-flow graph (a source node has no input edges). The output signal C(s) is the Laplace-transformed output variable. It is represented as a sink node in the flow diagram (a sink has no output edges). G(s) and H(s) are transfer functions, with H(s) serving to feed back a modified version of the output to the input, B(s). The two flow graph representations are equivalent.

<h2 id="interpreting-causality">Interpreting 'causality'</h2>
The term "cause and effect" was applied by Mason to SFGs:<a class="footnote-ref" id="fnref:50" href="#fn:50">50</a> 

"The process of constructing a graph is one of tracing a succession of cause and effects through the physical system. One variable is expressed as an explicit effect due to certain causes; they in turn, are recognized as effects due to still other causes."
— S.J. Mason: Section IV: Illustrative applications of flow graph technique
and has been repeated by many later authors:<a class="footnote-ref" id="fnref:51" href="#fn:51">51</a>

"The signal flow graph is another visual tool for representing causal relationships between components of the system. It is a simplified version of a block diagram introduced by S.J. Mason as a cause-and-effect representation of linear systems."
— Arthur G.O. Mutambara: Design and Analysis of Control Systems, p.238
However, Mason's paper is concerned to show in great detail how a set of equations is connected to an SFG, an emphasis unrelated to intuitive notions of "cause and effect". Intuitions can be helpful for arriving at an SFG or for gaining insight from an SFG, but are inessential to the SFG. The essential connection of the SFG is to its own set of equations, as described, for example, by Ogata:<a class="footnote-ref" id="fnref:52" href="#fn:52">52</a>

"A signal-flow graph is a diagram that represents a set of simultaneous algebraic equations. When applying the signal flow graph method to analysis of control systems, we must first transform linear differential equations into algebraic equations in [the <a href="/facts/Laplace_transform/0Ge4MIc9">Laplace transform</a> variable] s.."
— Katsuhiko Ogata: Modern Control Engineering, p. 104
There is no reference to "cause and effect" here, and as said by Barutsky:<a class="footnote-ref" id="fnref:53" href="#fn:53">53</a>

"Like block diagrams, signal flow graphs represent the computational, not the physical structure of a system."
— Wolfgang Borutzky, Bond Graph Methodology, p. 10
The term "cause and effect" may be misinterpreted as it applies to the SFG, and taken incorrectly to suggest a system view of causality,<a class="footnote-ref" id="fnref:54" href="#fn:54">54</a> rather than a computationally based meaning. To keep discussion clear, it may be advisable to use the term "computational causality", as is suggested for <a href="/facts/Bond_graphs/ePWCpEVX">bond graphs</a>:<a class="footnote-ref" id="fnref:55" href="#fn:55">55</a>

"Bond-graph literature uses the term computational causality, indicating the order of calculation in a simulation, in order to avoid any interpretation in the sense of intuitive causality."
The term "computational causality" is explained using the example of current and voltage in a resistor:<a class="footnote-ref" id="fnref:56" href="#fn:56">56</a>

"The computational causality of physical laws can therefore not be predetermined, but depends upon the particular use of that law. We cannot conclude whether it is the current flowing through a resistor that causes a voltage drop, or whether it is the difference in potentials at the two ends of the resistor that cause current to flow. Physically these are simply two concurrent aspects of one and the same physical phenomenon. Computationally, we may have to assume at times one position, and at other times the other."
— François Cellier & Ernesto Kofman: §1.5 Simulation software today and tomorrow, p. 15
A computer program or algorithm can be arranged to solve a set of equations using various strategies. They differ in how they prioritize finding some of the variables in terms of the others, and these algorithmic decisions, which are simply about solution strategy, then set up the variables expressed as dependent variables earlier in the solution to be "effects", determined by the remaining variables that now are "causes", in the sense of "computational causality".
Using this terminology, it is computational causality, not system causality, that is relevant to the SFG. There exists a wide-ranging philosophical debate, not concerned specifically with the SFG, over connections between computational causality and system causality.<a class="footnote-ref" id="fnref:57" href="#fn:57">57</a>

<h2 id="signal-flow-graphs-for-analysis-and-design">Signal-flow graphs for analysis and design</h2>
Signal-flow graphs can be used for analysis, that is for understanding a model of an existing system, or for synthesis, that is for determining the properties of a design alternative.

<h3>Signal-flow graphs for dynamic systems analysis</h3>
When building a model of a dynamic system, a list of steps is provided by Dorf & Bishop:<a class="footnote-ref" id="fnref:58" href="#fn:58">58</a>

<ul><li>Define the system and its components.</li>
<li>Formulate the mathematical model and list the needed assumptions.</li>
<li>Write the differential equations describing the model.</li>
<li>Solve the equations for the desired output variables.</li>
<li>Examine the solutions and the assumptions.</li>
<li>If needed, reanalyze or redesign the system.</li></ul>
—RC Dorf and RH Bishop, Modern Control Systems, Chapter 2, p. 2
In this workflow, equations of the physical system's mathematical model are used to derive the signal-flow graph equations.

<h3>Signal-flow graphs for design synthesis</h3>
Signal-flow graphs have been used in <a href="/facts/Design_Space_Exploration/MCqcNb5U">Design Space Exploration (DSE)</a>, as an intermediate representation towards a physical implementation. The DSE process seeks a suitable solution among different alternatives. In contrast with the typical analysis workflow, where a system of interest is first modeled with the physical equations of its components, the specification for synthesizing a design could be a desired transfer function. For example, different strategies would create different signal-flow graphs, from which implementations are derived.<a class="footnote-ref" id="fnref:59" href="#fn:59">59</a>
Another example uses an annotated SFG as an expression of the continuous-time behavior, as input to an architecture generator<a class="footnote-ref" id="fnref:60" href="#fn:60">60</a>

<h2 id="shannon-and-shannon-happ-formulas">Shannon and Shannon-Happ formulas</h2>
Shannon's formula is an analytic expression for calculating the gain of an interconnected set of amplifiers in an analog computer. During World War II, while investigating the functional operation of an analog computer, Claude Shannon developed his formula. Because of wartime restrictions, Shannon's work was not published at that time, and, in 1952, <a href="/facts/Samuel_Jefferson_Mason/PfIReDmH">Mason</a> rediscovered the same formula.
<a href="/facts/William_W._Happ/Agd0F00v">William W. Happ</a> generalized the Shannon formula for topologically closed systems.<a class="footnote-ref" id="fnref:61" href="#fn:61">61</a> The Shannon-Happ formula can be used for deriving transfer functions, sensitivities, and error functions.<a class="footnote-ref" id="fnref:62" href="#fn:62">62</a>
For a consistent set of linear unilateral relations, the Shannon-Happ formula expresses the solution using direct substitution (non-iterative).<a class="footnote-ref" id="fnref:63" href="#fn:63">63</a><a class="footnote-ref" id="fnref:64" href="#fn:64">64</a>
NASA's electrical circuit software NASAP is based on the Shannon-Happ formula.<a class="footnote-ref" id="fnref:65" href="#fn:65">65</a><a class="footnote-ref" id="fnref:66" href="#fn:66">66</a>

<h2 id="linear-signal-flow-graph-examples">Linear signal-flow graph examples</h2>
<h3>Simple voltage amplifier</h3>

The amplification of a signal V1 by an amplifier with gain a12 is described mathematically by

V
          
            2
          
        
        =
        
          a
          
            12
          
        
        
          V
          
            1
          
        
        
        .
      
    
    {\displaystyle V_{2}=a_{12}V_{1}\,.}

This relationship represented by the signal-flow graph of Figure 1. is that V2 is dependent on V1 but it implies no dependency of V1 on V2. See Kou page 57.<a class="footnote-ref" id="fnref:67" href="#fn:67">67</a>

<h3>Ideal negative feedback amplifier</h3>

A possible SFG for the <a href="/facts/Asymptotic_gain_model/BWFNFh29">asymptotic gain model</a> for a <a href="/facts/Negative_feedback_amplifier/zQSRBReJ">negative feedback amplifier</a> is shown in Figure 3, and leads to the equation for the gain of this amplifier as

G
        =
        
          
            
              y
              
                2
              
            
            
              x
              
                1
              
            
          
        
      
    
    {\displaystyle G={\frac {y_{2}}{x_{1}}}}
  
 
  
    
      
        =
        
          G
          
            ∞
          
        
        
          (
          
            
              T
              
                T
                +
                1
              
            
          
          )
        
        +
        
          G
          
            0
          
        
        
          (
          
            
              1
              
                T
                +
                1
              
            
          
          )
        
         
        .
      
    
    {\displaystyle =G_{\infty }\left({\frac {T}{T+1}}\right)+G_{0}\left({\frac {1}{T+1}}\right)\ .}

The interpretation of the parameters is as follows: T = <a href="/facts/Return_ratio/7rfrC28d">return ratio</a>, G∞ = direct amplifier gain, G0 = feedforward (indicating the possible <a href="/facts/Electronic_amplifier/pnRgxncC">bilateral</a> nature of the feedback, possibly deliberate as in the case of feedforward <a href="/facts/Lead-lag_compensator/05Qmo4DE">compensation</a>). Figure 3 has the interesting aspect that it resembles Figure 2 for the two-port network with the addition of the extra feedback relation x2 = T y1.
From this gain expression an interpretation of the parameters G0 and G∞ is evident, namely:

G
          
            ∞
          
        
        =
        
          lim
          
            T
            →
            ∞
          
        
        G
         
        ;
         
        
          G
          
            0
          
        
        =
        
          lim
          
            T
            →
            0
          
        
        G
         
        .
      
    
    {\displaystyle G_{\infty }=\lim _{T\to \infty }G\ ;\ G_{0}=\lim _{T\to 0}G\ .}

There are many possible SFG's associated with any particular gain relation. Figure 4 shows another SFG for the asymptotic gain model that can be easier to interpret in terms of a circuit. In this graph, parameter β is interpreted as a feedback factor and A as a "control parameter", possibly related to a dependent source in the circuit. Using this graph, the gain is

G
        =
        
          
            
              y
              
                2
              
            
            
              x
              
                1
              
            
          
        
      
    
    {\displaystyle G={\frac {y_{2}}{x_{1}}}}
  
 
  
    
      
        =
        
          G
          
            0
          
        
        +
        
          
            A
            
              1
              −
              β
              A
            
          
        
         
        .
      
    
    {\displaystyle =G_{0}+{\frac {A}{1-\beta A}}\ .}

To connect to the asymptotic gain model, parameters A and β cannot be arbitrary circuit parameters, but must relate to the return ratio T by:

T
        =
        −
        β
        A
         
        ,
      
    
    {\displaystyle T=-\beta A\ ,}

and to the asymptotic gain as:

G
          
            ∞
          
        
        =
        
          lim
          
            T
            →
            ∞
          
        
        G
        =
        
          G
          
            0
          
        
        −
        
          
            1
            β
          
        
         
        .
      
    
    {\displaystyle G_{\infty }=\lim _{T\to \infty }G=G_{0}-{\frac {1}{\beta }}\ .}

Substituting these results into the gain expression,

G
        =
        
          G
          
            0
          
        
        +
        
          
            1
            β
          
        
        
          
            
              −
              T
            
            
              1
              +
              T
            
          
        
      
    
    {\displaystyle G=G_{0}+{\frac {1}{\beta }}{\frac {-T}{1+T}}}

=
        
          G
          
            0
          
        
        +
        (
        
          G
          
            0
          
        
        −
        
          G
          
            ∞
          
        
        )
        
          
            
              −
              T
            
            
              1
              +
              T
            
          
        
      
    
    {\displaystyle =G_{0}+(G_{0}-G_{\infty }){\frac {-T}{1+T}}}

=
        
          G
          
            ∞
          
        
        
          
            T
            
              1
              +
              T
            
          
        
        +
        
          G
          
            0
          
        
        
          
            1
            
              1
              +
              T
            
          
        
         
        ,
      
    
    {\displaystyle =G_{\infty }{\frac {T}{1+T}}+G_{0}{\frac {1}{1+T}}\ ,}

which is the formula of the asymptotic gain model.

<h3>Electrical circuit containing a two-port network</h3>

The figure to the right depicts a circuit that contains a <a href="/facts/Two-port_network/cqUrBTYq">y-parameter two-port network</a>. Vin is the input of the circuit and V2 is the output. The two-port equations impose a set of linear constraints between its port voltages and currents. The terminal equations impose other constraints. All these constraints are represented in the SFG (Signal Flow Graph) below the circuit. There is only one path from input to output which is shown in a different color and has a (voltage) gain of -RLy21. There are also three loops: -Riny11, -RLy22, Riny21RLy12. Sometimes a loop indicates intentional feedback but it can also indicate a constraint on the relationship of two variables. For example, the equation that describes a resistor says that the ratio of the voltage across the resistor to the current through the resistor is a constant which is called the resistance. This can be interpreted as the voltage is the input and the current is the output, or the current is the input and the voltage is the output, or merely that the voltage and current have a linear relationship. Virtually all passive two terminal devices in a circuit will show up in the SFG as a loop.
The SFG and the schematic depict the same circuit, but the schematic also suggests the circuit's purpose. Compared to the schematic, the SFG is awkward but it does have the advantage that the input to output gain can be written down by inspection using <a href="/facts/Mason%2527s_rule/7GRvcxKG">Mason's rule</a>.

<h3>Mechatronics : Position servo with multi-loop feedback</h3>

This example is representative of a SFG (signal-flow graph) used to represent a servo control system and illustrates several features of SFGs. Some of the loops (loop 3, loop 4 and loop 5) are extrinsic intentionally designed feedback loops. These are shown with dotted lines. There are also intrinsic loops (loop 0, loop1, loop2) that are not intentional feedback loops, although they can be analyzed as though they were. These loops are shown with solid lines. Loop 3 and loop 4 are also known as minor loops because they are inside a larger loop.

<ul><li>The forward path begins with θC, the desired position command. This is multiplied by KP which could be a constant or a function of frequency. KP incorporates the conversion gain of the DAC and any filtering on the DAC output. The output of KP is the velocity command VωC which is multiplied by KV which can be a constant or a function of frequency. The output of KV is the current command, VIC which is multiplied by KC which can be a constant or a function of frequency. The output of KC is the amplifier output voltage, VA. The current, IM, though the motor winding is the integral of the voltage applied to the inductance. The motor produces a torque, T, proportional to IM. Permanent magnet motors tend to have a linear current to torque function. The conversion constant of current to torque is KM. The torque, T, divided by the load moment of inertia, M, is the acceleration, α, which is integrated to give the load velocity ω which is integrated to produce the load position, θLC.</li>
<li>The forward path of loop 0 asserts that acceleration is proportional to torque and the velocity is the time integral of acceleration. The backward path says that as the speed increases there is a friction or drag that counteracts the torque. Torque on the load decreases proportionately to the load velocity until the point is reached that all the torque is used to overcome friction and the acceleration drops to zero. Loop 0 is intrinsic.</li>
<li>Loop1 represents the interaction of an inductor's current with its internal and external series resistance. The current through an inductance is the time integral of the voltage across the inductance. When a voltage is first applied, all of it appears across the inductor. This is shown by the forward path through 
 
 
 
 
 
 1
 
 s
 
 
 L
 
 
 
 M
 
 
 
 
 
 
 
 
 
 {\displaystyle {\frac {1}{s\mathrm {L} _{\mathrm {M} }}}\,}
 
. As the current increases, voltage is dropped across the inductor internal resistance RM and the external resistance RS. This reduces the voltage across the inductor and is represented by the feedback path -(RM + RS). The current continues to increase but at a steadily decreasing rate until the current reaches the point at which all the voltage is dropped across (RM + RS). Loop 1 is intrinsic.</li>
<li>Loop2 expresses the effect of the motor back EMF. Whenever a permanent magnet motor rotates, it acts like a generator and produces a voltage in its windings. It does not matter whether the rotation is caused by a torque applied to the drive shaft or by current applied to the windings. This voltage is referred to as back EMF. The conversion gain of rotational velocity to back EMF is GM. The polarity of the back EMF is such that it diminishes the voltage across the winding inductance. Loop 2 is intrinsic.</li>
<li>Loop 3 is extrinsic. The current in the motor winding passes through a sense resister. The voltage, VIM, developed across the sense resister is fed back to the negative terminal of the power amplifier KC. This feedback causes the voltage amplifier to act like a voltage controlled current source. Since the motor torque is proportional to motor current, the sub-system VIC to the output torque acts like a voltage controlled torque source. This sub-system may be referred to as the "current loop" or "torque loop". Loop 3 effectively diminishes the effects of loop 1 and loop 2.</li>
<li>Loop 4 is extrinsic. A tachometer (actually a low power dc generator) produces an output voltage VωM that is proportional to is angular velocity. This voltage is fed to the negative input of KV. This feedback causes the sub-system from VωC to the load angular velocity to act like a voltage to velocity source. This sub-system may be referred to as the "velocity loop". Loop 4 effectively diminishes the effects of loop 0 and loop 3.</li>
<li>Loop 5 is extrinsic. This is the overall position feedback loop. The feedback comes from an angle encoder that produces a digital output. The output position is subtracted from the desired position by digital hardware which drives a DAC which drives KP. In the SFG, the conversion gain of the DAC is incorporated into KP.</li></ul>
See <a href="/facts/Mason%2527s_rule/7GRvcxKG">Mason's rule</a> for development of Mason's Gain Formula for this example.

<h2 id="terminology-and-classification-of-signal-flow-graphs">Terminology and classification of signal-flow graphs</h2>
There is some confusion in literature about what a signal-flow graph is; <a href="/facts/Henry_Paynter/Gfp2nxPP">Henry Paynter</a>, inventor of <a href="/facts/Bond_graphs/ePWCpEVX">bond graphs</a>, writes: "But much of the decline of signal-flow graphs [...] is due in part to the mistaken notion that the branches must be linear and the nodes must be summative. Neither assumption was embraced by Mason, himself !"<a class="footnote-ref" id="fnref:68" href="#fn:68">68</a>

<h3>Standards covering signal-flow graphs</h3>
<ul><li>IEEE Std 155-1960, IEEE Standards on Circuits: Definitions of Terms for Linear Signal Flow Graphs, 1960.</li></ul>
This IEEE standard defines a signal-flow graph as a network of directed branches representing dependent and independent signals as nodes. Incoming branches carry branch signals to the dependent node signals. A dependent node signal is the algebraic sum of the incoming branch signals at that node, i.e. nodes are summative.
<h3>State transition signal-flow graph</h3>

A state transition SFG or state diagram is a simulation diagram for a system of equations, including the initial conditions of the states.<a class="footnote-ref" id="fnref:69" href="#fn:69">69</a>

<h3>Closed flowgraph</h3>
 Closed flowgraphs describe closed systems and have been utilized to provide a rigorous theoretical basis for topological techniques of circuit analysis.<a class="footnote-ref" id="fnref:70" href="#fn:70">70</a>
<ul><li>Terminology for closed flowgraph theory includes:
<ul><li>Contributive node. Summing point for two or more incoming signals resulting in only one outgoing signal.</li>
<li>Distributive node. Sampling point for two or more outgoing signals resulting from only one incoming signal.</li>
<li>Compound node. Contraction of a contributive node and a distributive node.</li>
<li>Strictly dependent & strictly independent node. A strictly independent node represent s an independent source; a strictly dependent node represents a meter.</li>
<li>Open & Closed Flowgraphs. An open flowgraph contains strictly dependent or strictly independent nodes; otherwise it is a closed flowgraph.</li></ul></li></ul>
<h2 id="nonlinear-flow-graphs">Nonlinear flow graphs</h2>
Mason introduced both nonlinear and linear flow graphs. To clarify this point, Mason wrote : "A linear flow graph is one whose associated equations are linear."<a class="footnote-ref" id="fnref:71" href="#fn:71">71</a>

<h3>Examples of nonlinear branch functions</h3>
It we denote by xj the signal at node j, the following are examples of node functions that do not pertain to a <a href="/facts/Linear_time-invariant_system/kEmj0QDC">linear time-invariant system</a>:

x
                  
                    
                      j
                    
                  
                
              
              
                
                =
                
                  x
                  
                    
                      k
                    
                  
                
                ×
                
                  x
                  
                    
                      l
                    
                  
                
              
            
            
              
                
                  x
                  
                    
                      k
                    
                  
                
              
              
                
                =
                a
                b
                s
                (
                
                  x
                  
                    
                      j
                    
                  
                
                )
              
            
            
              
                
                  x
                  
                    
                      l
                    
                  
                
              
              
                
                =
                log
                ⁡
                (
                
                  x
                  
                    
                      k
                    
                  
                
                )
              
            
            
              
                
                  x
                  
                    
                      m
                    
                  
                
              
              
                
                =
                t
                ×
                
                  x
                  
                    
                      j
                    
                  
                
                
                   ,where 
                
                t
                
                   represents time
                
              
            
          
        
      
    
    {\displaystyle {\begin{aligned}x_{\mathrm {j} }&=x_{\mathrm {k} }\times x_{\mathrm {l} }\\x_{\mathrm {k} }&=abs(x_{\mathrm {j} })\\x_{\mathrm {l} }&=\log(x_{\mathrm {k} })\\x_{\mathrm {m} }&=t\times x_{\mathrm {j} }{\text{ ,where }}t{\text{ represents time}}\\\end{aligned}}}

<h3>Examples of nonlinear signal-flow graph models</h3>
<ul><li>Although they generally can't be transformed between time domain and frequency domain representations for classical control theory analysis, nonlinear signal-flow graphs can be found in electrical engineering literature.<a class="footnote-ref" id="fnref:72" href="#fn:72">72</a><a class="footnote-ref" id="fnref:73" href="#fn:73">73</a></li>
<li>Nonlinear signal-flow graphs can also be found in life sciences, for example, Dr <a href="/facts/Arthur_Guyton/mKTBsscD">Arthur Guyton</a>'s model of the cardiovascular system.<a class="footnote-ref" id="fnref:74" href="#fn:74">74</a></li></ul>
<h2 id="applications-of-sfg-techniques-in-various-fields-of-science">Applications of SFG techniques in various fields of science</h2>
<ul><li><a href="/facts/Electronic_circuits/IRfQ6Cc2">Electronic circuits</a>
<ul><li>Characterizing sequential circuits of the <a href="/facts/Moore_state_machine/rVPV8AGH">Moore</a> and <a href="/facts/Mealy_state_machine/Aw1sPMYB">Mealy</a> type, obtaining <a href="/facts/Regular_Expressions/KFL3veHX">regular expressions</a> from <a href="/facts/State_diagram/XAjvtq7t">state diagrams</a>.<a class="footnote-ref" id="fnref:75" href="#fn:75">75</a></li>
<li>Synthesis of non-linear data converters<a class="footnote-ref" id="fnref:76" href="#fn:76">76</a></li>
<li>Control and network theory</li>
<li>Stochastic signal processing.<a class="footnote-ref" id="fnref:77" href="#fn:77">77</a></li>
<li>Reliability of electronic systems<a class="footnote-ref" id="fnref:78" href="#fn:78">78</a></li></ul></li>
<li><a href="/facts/Physiology/fh25y2pQ">Physiology</a> and <a href="/facts/Biophysics/l9u5gqCy">biophysics</a>
<ul><li>Cardiac output regulation<a class="footnote-ref" id="fnref:79" href="#fn:79">79</a></li></ul></li>
<li><a href="/facts/Simulation/Q4QJV1oI">Simulation</a>
<ul><li>Simulation on analog computers<a class="footnote-ref" id="fnref:80" href="#fn:80">80</a></li></ul></li>
<li><a href="/facts/Neuroscience/o5RV8Cas">Neuroscience</a> and <a href="/facts/Combinatorics/k14xUoKT">Combinatorics</a>
<ul><li>Study of Polychrony<a class="footnote-ref" id="fnref:81" href="#fn:81">81</a><a class="footnote-ref" id="fnref:82" href="#fn:82">82</a></li></ul></li></ul>
<h2 id="see-also">See also</h2>
<ul><li><a href="/facts/Asymptotic_gain_model/BWFNFh29">Asymptotic gain model</a></li>
<li><a href="/facts/Bond_graphs/ePWCpEVX">Bond graphs</a></li>
<li><a href="/facts/Coates_graph/bUDCA6u4">Coates graph</a></li>
<li>Control Systems/Signal Flow Diagrams in the Control Systems <a href="/facts/Wikibooks/2VrJRNqY">Wikibook</a></li>
<li><a href="/facts/Flow_graph_(mathematics)/vL55kdQT">Flow graph (mathematics)</a></li>
<li><a href="/facts/Leapfrog_filter/WY4HEVTv">Leapfrog filter</a> for an example of filter design using a signal flow graph</li>
<li><a href="/facts/Mason%2527s_gain_formula/7GRvcxKG">Mason's gain formula</a></li>
<li><a href="/facts/Minor_loop_feedback/KGlfekpv">Minor loop feedback</a></li>
<li><a href="/facts/Noncommutative_signal-flow_graph/tdaWoUJ7">Noncommutative signal-flow graph</a></li></ul>
<h2 id="notes">Notes</h2>

<ul><li>Ernest J. Henley & R. A. Williams (1973). Graph theory in modern engineering; computer aided design, control, optimization, reliability analysis. Academic Press. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-08-095607-7. Book almost entirely devoted to this topic.</li>
<li>Kou, Benjamin C. (1967), Automatic Control Systems, Prentice Hall</li>
<li>Robichaud, Louis P.A.; Maurice Boisvert; Jean Robert (1962). <a href="http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380">Signal flow graphs and applications</a>. Prentice-Hall electrical engineering series. Englewood Cliffs, N.J.: Prentice Hall. pp. xiv, 214 p.</li>
<li>Deo, Narsingh (1974), <a href="https://books.google.com/books?id=Yr2pJA950iAC">Graph Theory with Applications to Engineering and Computer Science</a>, PHI Learning Pvt. Ltd., p. 418, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-81-203-0145-0</li>
<li>K Thulasiramen; MNS Swarmy (2011). <a href="https://books.google.com/books?id=rFH7eQffQNkC&pg=PA163">"§6.11 The Coates and Mason graphs"</a>. Graphs: Theory and algorithms. John Wiley & Sons. pp. 163 ff. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9781118030257.</li>
<li>Ogata, Katsuhiko (2002). "Section 3-9 Signal Flow Graphs". Modern Control Engineering 4th Edition. Prentice-Hal. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-13-043245-2.</li>
<li>Phang, Khoman (2000-12-14). <a href="http://www.eecg.toronto.edu/~kphang/papers/PhDthesis.pdf">"2.5 An overview of Signal-flow graphs"</a> (PDF). CMOS Optical Preamplifier Design Using Graphical Circuit Analysis (Thesis). Department of Electrical and Computer Engineering, University of Toronto. © Copyright by Khoman Phang 2001</li></ul>
<h2 id="further-reading">Further reading</h2>
<ul><li>Wai-Kai Chen (1976). Applied Graph Theory. North Holland Publishing Company. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0720423624. Chapter 3 for the essentials, but applications are scattered throughout the book.</li>
<li>Wai-Kai Chen (May 1964). <a href="https://web.archive.org/web/20150110010404/http://www.dtic.mil/cgi-bin/GetTRDoc?AD=AD0601623">"Some applications of linear graphs"</a>. Contract DA-28-043-AMC-00073 (E). Coordinated Science Laboratory, University of Illinois, Urbana. Archived from <a href="http://www.dtic.mil/cgi-bin/GetTRDoc?AD=AD0601623">the original</a> on January 10, 2015.</li>
<li>K. Thulasiraman & M. N. S. Swamy (1992). Graphs: Theory and Algorithms. John Wiley & Sons. 6.10-6.11 for the essential mathematical idea. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0-471-51356-8.</li>
<li>Shu-Park Chan (2006). "Graph theory". In Richard C. Dorf (ed.). Circuits, Signals, and Speech and Image Processing (3rd ed.). CRC Press. § 3.6. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-1-4200-0308-6. Compares Mason and Coates graph approaches with Maxwell's k-tree approach.</li>
<li>RF Hoskins (2014). <a href="https://books.google.com/books?id=6DeoBQAAQBAJ&pg=PA156">"Flow-graph and signal flow-graph analysis of linear systems"</a>. In SR Deards (ed.). Recent Developments in Network Theory: Proceedings of the Symposium Held at the College of Aeronautics, Cranfield, September 1961. Elsevier. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 9781483223568. A comparison of the utility of the <a href="/facts/Coates_graph/bUDCA6u4">Coates flow graph</a> and the Mason flow graph.</li></ul>
<h2 id="external-links">External links</h2>

The Wikibook Control Systems has a page on the topic of: Electrical engineering: Construction of a flow graph for a RC circuit

The Wikibook Control Systems has a page on the topic of: Examples of systematic reduction

<ul><li><a href="https://web.archive.org/web/20040325002849/http://www.apl.jhu.edu/Classes/Notes/Penn/EE774/Chap_03r.pdf">M. L. Edwards: S-parameters, signal flow graphs, and other matrix representations </a> All Rights Reserved</li>
<li><a href="https://tube.switch.ch/channels/d206c96c">H Schmid: Signal-Flow Graphs in 12 Short Lessons </a></li>
<li> Control Systems/Signal Flow Diagrams at Wikibooks</li>
<li> Media related to Signal flow graphs at Wikimedia Commons</li></ul>

<h2 id="references">References</h2>

<ol>
<li id="fn:1">CE Shannon (January 1942). "The theory and design of linear differential equation machines". Fire Control of the US National Defense Research Committee: Report 411, Section D-2. {{cite journal}}: Cite journal requires |journal= (help) Reprinted in N. J. A. Sloane; Aaron D. Wyner, eds. (1993). Claude E. Shannon: Collected Papers. Wiley IEEE Press. p. 514. ISBN 978-0-7803-0434-5. <a href="978-0-7803-0434-5" target="_blank">978-0-7803-0434-5</a> <a href="#fnref:1" class="footnote-back-ref">↩</a></li>
<li id="fn:2">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:2" class="footnote-back-ref">↩</a></li>
<li id="fn:3">Jørgen Bang-Jensen; Gregory Z. Gutin (2008). Digraphs. Springer. ISBN 9781848009981. <a href="9781848009981" target="_blank">9781848009981</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></li>
<li id="fn:4">Bela Bollobas (1998). Modern graph theory. Springer Science & Business Media. p. 8. ISBN 9781461206194.i <a href="9781461206194" target="_blank">9781461206194</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></li>
<li id="fn:5">CE Shannon (January 1942). "The theory and design of linear differential equation machines". Fire Control of the US National Defense Research Committee: Report 411, Section D-2. {{cite journal}}: Cite journal requires |journal= (help) Reprinted in N. J. A. Sloane; Aaron D. Wyner, eds. (1993). Claude E. Shannon: Collected Papers. Wiley IEEE Press. p. 514. ISBN 978-0-7803-0434-5. <a href="978-0-7803-0434-5" target="_blank">978-0-7803-0434-5</a> <a href="#fnref:5" class="footnote-back-ref">↩</a></li>
<li id="fn:6">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:6" class="footnote-back-ref">↩</a></li>
<li id="fn:7">SJ Mason (July 1956). "Feedback Theory-Further Properties of Signal Flow Graphs". Proceedings of the IRE. 44 (7): 920–926. doi:10.1109/JRPROC.1956.275147. hdl:1721.1/4778. S2CID 18184015. On-line version found at MIT Research Laboratory of Electronics. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:7" class="footnote-back-ref">↩</a></li>
<li id="fn:8">Chen, Wai-Kai (1976). Applied Graph Theory : Graphs and Electrical Networks. Elsevier. ISBN 9781483164151.(WKC 1976, p. 167) harv error: no target: CITEREFWKC1976 (help) <a href="9781483164151" target="_blank">9781483164151</a> <a href="#fnref:8" class="footnote-back-ref">↩</a></li>
<li id="fn:9">CE Shannon (January 1942). "The theory and design of linear differential equation machines". Fire Control of the US National Defense Research Committee: Report 411, Section D-2. {{cite journal}}: Cite journal requires |journal= (help) Reprinted in N. J. A. Sloane; Aaron D. Wyner, eds. (1993). Claude E. Shannon: Collected Papers. Wiley IEEE Press. p. 514. ISBN 978-0-7803-0434-5. <a href="978-0-7803-0434-5" target="_blank">978-0-7803-0434-5</a> <a href="#fnref:9" class="footnote-back-ref">↩</a></li>
<li id="fn:10">Lorens, Charles Stanton (July 15, 1956), Vogel, Dan (ed.), Technical Report 317 - Theory and applications of flow graphs (PDF), Research Laboratory of Electronics, MIT <a href="http://dspace.mit.edu/bitstream/handle/1721.1/4765/rle-tr-317-04734656.pdf?sequence=1" target="_blank">http://dspace.mit.edu/bitstream/handle/1721.1/4765/rle-tr-317-04734656.pdf?sequence=1</a> <a href="#fnref:10" class="footnote-back-ref">↩</a></li>
<li id="fn:11">(WKC 1976, p. 169) harv error: no target: CITEREFWKC1976 (help) <a href="#fnref:11" class="footnote-back-ref">↩</a></li>
<li id="fn:12">Louis PA Robichaud; Maurice Boisvert; Jean Robert (1962). "Preface". Signal flow graphs and applications. Prentice-Hall electrical engineering series. Prentice Hall. p. x. ASIN B0000CLM1G. <a href="http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8" target="_blank">http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8</a> <a href="#fnref:12" class="footnote-back-ref">↩</a></li>
<li id="fn:13">Horace M Trent (1955). "Isomorphisms between Oriented Linear Graphs and Lumped Physical Systems". Journal of the Acoustical Society of America. 27 (3): 500–527. Bibcode:1955ASAJ...27..500T. doi:10.1121/1.1907949. <a href="/wiki/Bibcode_(identifier)" target="_blank">/wiki/Bibcode_(identifier)</a> <a href="#fnref:13" class="footnote-back-ref">↩</a></li>
<li id="fn:14">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:14" class="footnote-back-ref">↩</a></li>
<li id="fn:15">Louis PA Robichaud; Maurice Boisvert; Jean Robert (1962). "Preface". Signal flow graphs and applications. Prentice-Hall electrical engineering series. Prentice Hall. p. x. ASIN B0000CLM1G. <a href="http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8" target="_blank">http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8</a> <a href="#fnref:15" class="footnote-back-ref">↩</a></li>
<li id="fn:16">(Robichaud 1962, p. ix) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:16" class="footnote-back-ref">↩</a></li>
<li id="fn:17">Louis PA Robichaud; Maurice Boisvert; Jean Robert (1962). "Preface". Signal flow graphs and applications. Prentice-Hall electrical engineering series. Prentice Hall. p. x. ASIN B0000CLM1G. <a href="http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8" target="_blank">http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8</a> <a href="#fnref:17" class="footnote-back-ref">↩</a></li>
<li id="fn:18">Narsingh Deo (2004). Graph Theory with Applications to Engineering and Computer Science. PHI Learning Pvt. Ltd. p. 418. ISBN 9788120301450. <a href="9788120301450" target="_blank">9788120301450</a> <a href="#fnref:18" class="footnote-back-ref">↩</a></li>
<li id="fn:19">Kofránek, J; Mateják, M; Privitzer, P; Tribula, M (2008), Causal or acausal modeling: labour for humans or labour for machines (PDF), Technical Computing Prague 2008. Conference Proceedings., Prague, p. 16, archived from the original (PDF) on 2009-12-29{{citation}}: CS1 maint: location missing publisher (link) <a href="https://web.archive.org/web/20091229065507/http://www2.humusoft.cz/kofranek/058_Kofranek.pdf" target="_blank">https://web.archive.org/web/20091229065507/http://www2.humusoft.cz/kofranek/058_Kofranek.pdf</a> <a href="#fnref:19" class="footnote-back-ref">↩</a></li>
<li id="fn:20">J Choma, Jr (April 1990). "Signal flow analysis of feedback networks". IEEE Transactions on Circuits and Systems. 37 (4): 455–463. Bibcode:1990ITCS...37..455C. doi:10.1109/31.52748. <a href="http://wenku.baidu.com/view/e046d9d528ea81c758f578c7.html" target="_blank">http://wenku.baidu.com/view/e046d9d528ea81c758f578c7.html</a> <a href="#fnref:20" class="footnote-back-ref">↩</a></li>
<li id="fn:21">Wai-Kai Chen (1971). "Chapter 3: Directed graph solutions of linear algebraic equations". Applied graph theory. North-Holland Pub. Co. p. 140. ISBN 978-0444101051. Partly accessible using Amazon's look-inside feature. <a href="978-0444101051" target="_blank">978-0444101051</a> <a href="#fnref:21" class="footnote-back-ref">↩</a></li>
<li id="fn:22">See, for example, Katsuhiko Ogata (2004). "Chapter 3-9: Signal flow graph representation of linear systems". Modern Control Engineering (4th ed.). Prentice Hall. pp. 106 ff. ISBN 978-0130609076. However, there is not a one-to-one correspondence: Narsingh Deo (2004). Graph Theory with Applications to Engineering and Computer Science. PHI Learning Pvt. Ltd. p. 418. ISBN 9788120301450. <a href="978-01306090769788120301450" target="_blank">978-01306090769788120301450</a> <a href="#fnref:22" class="footnote-back-ref">↩</a></li>
<li id="fn:23">Kuo, Benjamin C. (1967). Automatic Control Systems (2nd ed.). Prentice-Hall. pp. 59–60. <a href="#fnref:23" class="footnote-back-ref">↩</a></li>
<li id="fn:24">Kuo, Benjamin C. (1967). Automatic Control Systems (2nd ed.). Prentice-Hall. pp. 59–60. <a href="#fnref:24" class="footnote-back-ref">↩</a></li>
<li id="fn:25">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:25" class="footnote-back-ref">↩</a></li>
<li id="fn:26">Louis PA Robichaud; Maurice Boisvert; Jean Robert (1962). "§1-4: Definitions and terminology". Signal flow graphs and applications. Prentice-Hall electrical engineering series. Prentice Hall. p. 8. ASIN B0000CLM1G. <a href="http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8" target="_blank">http://babel.hathitrust.org/cgi/pt?id=uc1.b4338380;view=1up;seq=8</a> <a href="#fnref:26" class="footnote-back-ref">↩</a></li>
<li id="fn:27">J. R. Abrahams; G. P. Coverley (2014). "Chapter 2: Operations with a flow graph". Signal Flow Analysis: The Commonwealth and International Library. Elsevier. pp. 21 ff. ISBN 9781483180700. <a href="9781483180700" target="_blank">9781483180700</a> <a href="#fnref:27" class="footnote-back-ref">↩</a></li>
<li id="fn:28">Isaac M. Horowitz (2013). "Reduction of signal-flow graphs". Synthesis of Feedback Systems. Elsevier. pp. 18 ff. ISBN 9781483267708. <a href="9781483267708" target="_blank">9781483267708</a> <a href="#fnref:28" class="footnote-back-ref">↩</a></li>
<li id="fn:29">(Ogata 2002, pp. 68, 106) - Ogata, Katsuhiko (2002). "Section 3-9 Signal Flow Graphs". Modern Control Engineering 4th Edition. Prentice-Hal. ISBN 978-0-13-043245-2. <a href="#fnref:29" class="footnote-back-ref">↩</a></li>
<li id="fn:30">(Ogata 2002, pp. 105, 106) - Ogata, Katsuhiko (2002). "Section 3-9 Signal Flow Graphs". Modern Control Engineering 4th Edition. Prentice-Hal. ISBN 978-0-13-043245-2. <a href="#fnref:30" class="footnote-back-ref">↩</a></li>
<li id="fn:31">(Henley 1973, p. 12) harv error: no target: CITEREFHenley1973 (help) <a href="#fnref:31" class="footnote-back-ref">↩</a></li>
<li id="fn:32">(Phang 2001, p. 37) harv error: no target: CITEREFPhang2001 (help) <a href="#fnref:32" class="footnote-back-ref">↩</a></li>
<li id="fn:33">Examples of the signal-flow graph reduction can be found in (Robichaud 1962, p. 186, Sec. 7-3 Algebraic reduction of signal flow graphs) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:33" class="footnote-back-ref">↩</a></li>
<li id="fn:34">(Robichaud 1962, pp. 9–10, Sec. 1–5: Reduction of the flow graph) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:34" class="footnote-back-ref">↩</a></li>
<li id="fn:35">(Robichaud 1962, pp. 9–10, Sec. 1–5: Reduction of the flow graph) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:35" class="footnote-back-ref">↩</a></li>
<li id="fn:36">(Robichaud 1962, pp. 182, 183 Sec. 7-1, 7-2 of Chapter 7: Algebraic reduction of signal flow graphs using a digital computer) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:36" class="footnote-back-ref">↩</a></li>
<li id="fn:37">(Robichaud 1962, p. 185, Sec. 7-2: Generalization of flow graphs) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:37" class="footnote-back-ref">↩</a></li>
<li id="fn:38">(Henley 1973, p. 12) harv error: no target: CITEREFHenley1973 (help) <a href="#fnref:38" class="footnote-back-ref">↩</a></li>
<li id="fn:39">(Robichaud 1962, pp. 9, Sec. 1–5 REDUCTION OF THE FLOW GRAPH) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:39" class="footnote-back-ref">↩</a></li>
<li id="fn:40">Fakhfakh, Mourad; Tlelo-Cuautle, Esteban; V. Fernández, Francisco (2012). "Section 4.1.2 Signal flow graphs algebra". In Fakhfakh (ed.). Design of Analog Circuits Through Symbolic Analysis. Bentham Science Publishers. p. 418. ISBN 978-1-60805-425-1. <a href="978-1-60805-425-1" target="_blank">978-1-60805-425-1</a> <a href="#fnref:40" class="footnote-back-ref">↩</a></li>
<li id="fn:41">Labrèche P., presentation: Linear Electrical Circuits:Symbolic Network Analysis, 1977. <a href="https://www.researchgate.net/publication/266391592_1977_Labreche_-_LINEAR_ELECTRICAL_CIRCUITS_SYMBOLIC_NETWORK_ANALYSIS" target="_blank">https://www.researchgate.net/publication/266391592_1977_Labreche_-_LINEAR_ELECTRICAL_CIRCUITS_SYMBOLIC_NETWORK_ANALYSIS</a> <a href="#fnref:41" class="footnote-back-ref">↩</a></li>
<li id="fn:42">Carl Engelman, The legacy of MATHLAB 68, published in Proceeding SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation, pages 29-41 [1] <a href="/wiki/Carl_Engelman" target="_blank">/wiki/Carl_Engelman</a> <a href="#fnref:42" class="footnote-back-ref">↩</a></li>
<li id="fn:43">"... solving a set of simultaneous, linear algebraic equations. This problem, usually solved by matrix methods, can also be solved via graph theory. " Deo, Narsingh (1974). Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall of India. p. 416. ISBN 978-81-203-0145-0. also on-line at [2] <a href="978-81-203-0145-0" target="_blank">978-81-203-0145-0</a> <a href="#fnref:43" class="footnote-back-ref">↩</a></li>
<li id="fn:44">Deo, Narsingh (1974). Graph Theory with Applications to Engineering and Computer Science. Prentice-Hall of India. p. 417. ISBN 978-81-203-0145-0. also on-line at [3] <a href="978-81-203-0145-0" target="_blank">978-81-203-0145-0</a> <a href="#fnref:44" class="footnote-back-ref">↩</a></li>
<li id="fn:45">"A signal flow graph may be regarded as a simplified version of a block diagram. ... for cause and effect ... of linear systems ...we may regard the signal-flow graphs to be constrained by more rigid mathematical rules, whereas the usage of the block-diagram notation is less stringent." Kuo, Benjamin C. (1991). Automatic Control Systems (6th ed.). Prentice-Hall. p. 77. ISBN 978-0-13-051046-4. <a href="978-0-13-051046-4" target="_blank">978-0-13-051046-4</a> <a href="#fnref:45" class="footnote-back-ref">↩</a></li>
<li id="fn:46">Gene F. Franklin; et al. (Apr 29, 2014). "Appendix W.3 Block Diagram Reduction". Feedback Control of Dynamic Systems. Prentice Hall. <a href="#fnref:46" class="footnote-back-ref">↩</a></li>
<li id="fn:47">V.U.Bakshi U.A.Bakshi (2007). "Table 5.6: Comparison of block diagram and signal flow graph methods". Control Engineering. Technical Publications. p. 120. ISBN 9788184312935. <a href="9788184312935" target="_blank">9788184312935</a> <a href="#fnref:47" class="footnote-back-ref">↩</a></li>
<li id="fn:48">A Anand Kumar (2014). "Table: Comparison of block diagram and signal flow methods". Control Systems (2nd ed.). PHI Learning Pvt. Ltd. p. 165. ISBN 9788120349391. <a href="9788120349391" target="_blank">9788120349391</a> <a href="#fnref:48" class="footnote-back-ref">↩</a></li>
<li id="fn:49">HA Barker; M Chen; P. Townsend (2014). "Algorithms for transformations between block diagrams and digital flow graphs". Computer Aided Design in Control Systems 1988: Selected Papers from the 4th IFAC Symposium, Beijing, PRC, 23-25, August 1988. Elsevier. pp. 281 ff. ISBN 9781483298795. <a href="9781483298795" target="_blank">9781483298795</a> <a href="#fnref:49" class="footnote-back-ref">↩</a></li>
<li id="fn:50">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:50" class="footnote-back-ref">↩</a></li>
<li id="fn:51">For example, see Arthur G.O. Mutambara (1999). Design and Analysis of Control Systems. CRC Press. p. 238. ISBN 9780849318986. <a href="9780849318986" target="_blank">9780849318986</a> <a href="#fnref:51" class="footnote-back-ref">↩</a></li>
<li id="fn:52">Katsuhiko Ogata (1997). "Signal flow graphs". Modern Control Engineering (4th ed.). Prentice Hall. p. 104. ISBN 978-0130432452. <a href="978-0130432452" target="_blank">978-0130432452</a> <a href="#fnref:52" class="footnote-back-ref">↩</a></li>
<li id="fn:53">Wolfgang Borutzky (2009). Bond Graph Methodology: Development and Analysis of Multidisciplinary Dynamic System Models. Springer Science & Business Media. p. 10. ISBN 9781848828827. <a href="9781848828827" target="_blank">9781848828827</a> <a href="#fnref:53" class="footnote-back-ref">↩</a></li>
<li id="fn:54">James J. Callahan (2000). "Causality: Definition 2.10". The Geometry of Spacetime: An Introduction to Special and General Relativity. Springer Science & Business Media. p. 76. ISBN 9780387986418. <a href="9780387986418" target="_blank">9780387986418</a> <a href="#fnref:54" class="footnote-back-ref">↩</a></li>
<li id="fn:55">John JH Miller; Robert Vichnevetsky (July 22–26, 1991). John JH Miller; Robert Vichnevetsky (eds.). IMACS '91, Proceedings of the 13th IMACS World Congress on Computation and Applied Mathematics: July 22-26, 1991, Trinity College, Dublin, Ireland. International Association for Mathematics and Computers in Simulation.
 <a href="https://www.google.com/search?q=%22Bond-graph+literature+uses+the+term+computational+causality,+indicating+the+order+of+calculation+in+a+simulation,+in+order+to+avoid+any+interpretation+in+the+sense+of+intuitive+causality.+%22" target="_blank">https://www.google.com/search?q=%22Bond-graph+literature+uses+the+term+computational+causality,+indicating+the+order+of+calculation+in+a+simulation,+in+order+to+avoid+any+interpretation+in+the+sense+of+intuitive+causality.+%22</a> <a href="#fnref:55" class="footnote-back-ref">↩</a></li>
<li id="fn:56">François E. Cellier; Ernesto Kofman (2006). Continuous System Simulation. Springer Science & Business Media. p. 15. ISBN 9780387261027. <a href="9780387261027" target="_blank">9780387261027</a> <a href="#fnref:56" class="footnote-back-ref">↩</a></li>
<li id="fn:57">See, for example, Stephan Lewandowsky; Simon Farrell (2010). Computational Modeling in Cognition: Principles and Practice. SAGE Publications. ISBN 9781452236193.
 <a href="9781452236193" target="_blank">9781452236193</a> <a href="#fnref:57" class="footnote-back-ref">↩</a></li>
<li id="fn:58">Dorf, Richard C.; Bishop, Robert H. (2001). "Chap 2.-1: Introduction" (PDF). Modern Control Systems. Prentice Hall. p. 2. ISBN 978-0-13-030660-9. <a href="978-0-13-030660-9" target="_blank">978-0-13-030660-9</a> <a href="#fnref:58" class="footnote-back-ref">↩</a></li>
<li id="fn:59">Antao, B. A. A.; Brodersen, A.J. (June 1995). "ARCHGEN: Automated synthesis of analog systems". IEEE Transactions on Very Large Scale Integration (VLSI) Systems. 3 (2): 231–244. doi:10.1109/92.386223. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:59" class="footnote-back-ref">↩</a></li>
<li id="fn:60">Doboli, A.; Dhanwada, N.; Vemuri, R. (May 2000). "A heuristic technique for system-level architecture generation from signal-flow graph representations of analog systems". 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353). Circuits and Systems, 2000. Proceedings. ISCAS 2000 Geneva. The 2000 IEEE International Symposium on. Vol. 3. pp. 181–184. CiteSeerX 10.1.1.59.304. doi:10.1109/ISCAS.2000.856026. ISBN 978-0-7803-5482-1. S2CID 13948702. <a href="978-0-7803-5482-1" target="_blank">978-0-7803-5482-1</a> <a href="#fnref:60" class="footnote-back-ref">↩</a></li>
<li id="fn:61">Happ, William W. (1966). "Flowgraph Techniques for Closed Systems". IEEE Transactions on Aerospace and Electronic Systems. AES-2 (3): 252–264. Bibcode:1966ITAES...2..252H. doi:10.1109/TAES.1966.4501761. S2CID 51651723. <a href="/wiki/Bibcode_(identifier)" target="_blank">/wiki/Bibcode_(identifier)</a> <a href="#fnref:61" class="footnote-back-ref">↩</a></li>
<li id="fn:62">Potash, Hanan; McNamee, Lawrence P. (1968). "Application of unilateral and graph techniques to analysis of linear circuits: Solution by non-iterative methods". Proceedings, ACM National Conference: 367–378. doi:10.1145/800186.810601. S2CID 16623657. <a href="https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03" target="_blank">https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03</a> <a href="#fnref:62" class="footnote-back-ref">↩</a></li>
<li id="fn:63">Potash, Hanan; McNamee, Lawrence P. (1968). "Application of unilateral and graph techniques to analysis of linear circuits: Solution by non-iterative methods". Proceedings, ACM National Conference: 367–378. doi:10.1145/800186.810601. S2CID 16623657. <a href="https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03" target="_blank">https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03</a> <a href="#fnref:63" class="footnote-back-ref">↩</a></li>
<li id="fn:64">Okrent, Howard; McNamee, Lawrence P. (1970). "3. 3 Flowgraph Theory" (PDF). NASAP-70 User's and Programmer's manual. Los Angeles, California: School of Engineering and Applied Science, University of California at Los Angeles. pp. 3–9. <a href="https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19710025849.pdf" target="_blank">https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19710025849.pdf</a> <a href="#fnref:64" class="footnote-back-ref">↩</a></li>
<li id="fn:65">Potash, Hanan; McNamee, Lawrence P. (1968). "Application of unilateral and graph techniques to analysis of linear circuits: Solution by non-iterative methods". Proceedings, ACM National Conference: 367–378. doi:10.1145/800186.810601. S2CID 16623657. <a href="https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03" target="_blank">https://www.deepdyve.com/lp/association-for-computing-machinery/application-of-unilateral-and-graph-techniques-to-analysis-of-linear-b8r753Bq03</a> <a href="#fnref:65" class="footnote-back-ref">↩</a></li>
<li id="fn:66">Okrent, Howard; McNamee, Lawrence P. (1970). "3. 3 Flowgraph Theory" (PDF). NASAP-70 User's and Programmer's manual. Los Angeles, California: School of Engineering and Applied Science, University of California at Los Angeles. pp. 3–9. <a href="https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19710025849.pdf" target="_blank">https://ntrs.nasa.gov/archive/nasa/casi.ntrs.nasa.gov/19710025849.pdf</a> <a href="#fnref:66" class="footnote-back-ref">↩</a></li>
<li id="fn:67">Kou (1967, p. 57) - Kou, Benjamin C. (1967), Automatic Control Systems, Prentice Hall <a href="#fnref:67" class="footnote-back-ref">↩</a></li>
<li id="fn:68">Paynter, Henry (1992). "An Epistemic Prehistory of Bond Graphs" (PDF): 10, 15 pages. {{cite journal}}: Cite journal requires |journal= (help) <a href="https://www.me.utexas.edu/~longoria/paynter/hmp/BGprehistory.pdf" target="_blank">https://www.me.utexas.edu/~longoria/paynter/hmp/BGprehistory.pdf</a> <a href="#fnref:68" class="footnote-back-ref">↩</a></li>
<li id="fn:69">Houpis, Constantine H.; Sheldon, Stuart N. (2013). "section 8.8". Linear Control System Analysis and Design with MATLAB®, Sixth Edition. Boca Raton, FL: CRC press. pp. 171–172. ISBN 9781466504264. <a href="9781466504264" target="_blank">9781466504264</a> <a href="#fnref:69" class="footnote-back-ref">↩</a></li>
<li id="fn:70">Happ, William W. (1966). "Flowgraph Techniques for Closed Systems". IEEE Transactions on Aerospace and Electronic Systems. AES-2 (3): 252–264. Bibcode:1966ITAES...2..252H. doi:10.1109/TAES.1966.4501761. S2CID 51651723. <a href="/wiki/Bibcode_(identifier)" target="_blank">/wiki/Bibcode_(identifier)</a> <a href="#fnref:70" class="footnote-back-ref">↩</a></li>
<li id="fn:71">Mason, Samuel J. (September 1953). "Feedback Theory - Some Properties of Signal Flow Graphs" (PDF). Proceedings of the IRE. 41 (9): 1144–1156. doi:10.1109/jrproc.1953.274449. S2CID 17565263. The flow graph may be interpreted as a signal transmission system in which each node is a tiny repeater station. The station receives signals via the incoming branches, combines the information in some manner, and then transmits the results along each outgoing branch. <a href="http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf" target="_blank">http://ecee.colorado.edu/~ecen5014/Mason-IRE-1953.pdf</a> <a href="#fnref:71" class="footnote-back-ref">↩</a></li>
<li id="fn:72">For example: Baran, Thomas A.; Oppenhiem, Alan V. (2011), "Inversion of nonlinear and time-varying systems", 2011 Digital Signal Processing and Signal Processing Education Meeting (DSP/SPE), Digital Signal Processing Workshop and IEEE Signal Processing Education Workshop (DSP/SPE), IEEE, pp. 283–288, CiteSeerX 10.1.1.695.7460, doi:10.1109/DSP-SPE.2011.5739226, ISBN 978-1-61284-226-4, S2CID 5758954 <a href="978-1-61284-226-4" target="_blank">978-1-61284-226-4</a> <a href="#fnref:72" class="footnote-back-ref">↩</a></li>
<li id="fn:73">Guilherme, J.; Horta, N. C.; Franca, J. E. (1999). SYMBOLIC SYNTHESIS OF NON-LINEAR DATA CONVERTERS (PDF). <a href="http://orion.ipt.pt/~jorge/Docs/Artigos/icecs.pdf" target="_blank">http://orion.ipt.pt/~jorge/Docs/Artigos/icecs.pdf</a> <a href="#fnref:73" class="footnote-back-ref">↩</a></li>
<li id="fn:74">Hall, John E. (2004-11-01). "The pioneering use of systems analysis to study cardiac output regulation". American Journal of Physiology. Regulatory, Integrative and Comparative Physiology. 287 (5): R1009 – R1011. doi:10.1152/classicessays.00007.2004. ISSN 0363-6119. PMID 15475497. Figure 2, Arthur Guyton's computer model of the cardiovascular system, download jpeg {{cite journal}}: External link in |quote= (help) <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:74" class="footnote-back-ref">↩</a></li>
<li id="fn:75">BRZOZOWSKI, J.A.; McCLUSKEY, E. J. (1963). Signal Flow Graph Techniques for Sequential Circuit State Diagrams. IEEE Transactions on Electronic Computers. IEEE. p. 97. <a href="#fnref:75" class="footnote-back-ref">↩</a></li>
<li id="fn:76">Guilherme, J.; Horta, N. C.; Franca, J. E. (1999). SYMBOLIC SYNTHESIS OF NON-LINEAR DATA CONVERTERS (PDF). <a href="http://orion.ipt.pt/~jorge/Docs/Artigos/icecs.pdf" target="_blank">http://orion.ipt.pt/~jorge/Docs/Artigos/icecs.pdf</a> <a href="#fnref:76" class="footnote-back-ref">↩</a></li>
<li id="fn:77">Barry, J. R., Lee, E. A., & Messerschmitt, D. G. (2004). Digital communication (Third ed.). New York: Springer. p. 86. ISBN 978-0-7923-7548-7.{{cite book}}: CS1 maint: multiple names: authors list (link) <a href="978-0-7923-7548-7" target="_blank">978-0-7923-7548-7</a> <a href="#fnref:77" class="footnote-back-ref">↩</a></li>
<li id="fn:78">Happ, William W. (1964). Goldberg, M. F. (ed.). "Application of flowgraph techniques to the solution of reliability problems". Physics of Failure in Electronics (AD434/329): 375–423. doi:10.1109/IRPS.1963.362257. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:78" class="footnote-back-ref">↩</a></li>
<li id="fn:79">Hall, John E. (August 23, 2004). "The pioneering use of systems analysis to study cardiac output regulation". Am J Physiol Regul Integr Comp Physiol. 287 (5): R1009 – R1011. doi:10.1152/classicessays.00007.2004. PMID 15475497. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:79" class="footnote-back-ref">↩</a></li>
<li id="fn:80">(Robichaud 1962, chapter 5 Direct Simulation on Analog Computers Through Signal Flow Graphs) harv error: no target: CITEREFRobichaud1962 (help) <a href="#fnref:80" class="footnote-back-ref">↩</a></li>
<li id="fn:81">Izhikevich, Eugene M (Feb 2006). "Polychronization: computation with spikes". Neural Computation. 18 (2): 245–282. doi:10.1162/089976606775093882. PMID 16378515. S2CID 14253998. <a href="/wiki/Doi_(identifier)" target="_blank">/wiki/Doi_(identifier)</a> <a href="#fnref:81" class="footnote-back-ref">↩</a></li>
<li id="fn:82">Dolores-Cuenca, E.& Arciniega-Nevárez, J.A.& Nguyen, A.& Zou, A.Y.& Van Popering, L.& Crock, N.& Erlebacher, G.& Mendoza-Cortes, J.L. (April 2023). "Polychrony as Chinampas". Algorithms. 16 (4): 193. arXiv:2103.15265. doi:10.3390/a16040193.{{cite journal}}: CS1 maint: multiple names: authors list (link) <a href="https://doi.org/10.3390%2Fa16040193" target="_blank">https://doi.org/10.3390%2Fa16040193</a> <a href="#fnref:82" class="footnote-back-ref">↩</a></li>
</ol>

Signal-flow graph open-in-new

Signal-flow graph