Summary of ‘A Symbolic Analysis of Relay

and Switching Circuits’

Basic Electronics Engineering Course Assignment

Gaurav Gupta
Student ID: SC21B026
Aerospace Engineering Indian Institute of Space Science and Technology,
Thiruvanthapuram

June 2022
CONTENTS IIST, Thiruvanthapuram

Contents
1 Introduction 2

2 Aim 2

3 Method of Attack 2

4 Calculus of Switching Circuits 2

4.1 Fundamental Definitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
4.2 Fundamental Posthulates . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
4.3 Calculus of Propositions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
4.4 Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3

5 Series-Parallel Circuit 4

6 Star-Delta Network Transformations 4

7 Non-Series-Parallel Circuits 5
7.1 Method 1: Application of tranformations . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
7.2 Method 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
7.3 Method 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6
7.4 Simultaneous Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6

Page 1
1 INTRODUCTION
1 Introduction
A research paper titled “A Symbolic Analysis of
Relay and Switching Circuits” [1] was submitted
by Dr. Claude E. Shannon to American Insti-
tute of Electrical Engineers. Dr. Claude was a
research assistant in the department of electrical
engineering at Massachussets Institute of Tech-
nology, Cambridge. This paper is an abstract of
the thesis presented by him for the degree of mas-
ter of science at MIT.
The paper revolutionised the area of electri-
cal engineering. He introduced the application of
ideas presented by George Boole in his book ti-
tled The Mathematical Analysis of Logic (Fig.1)
to electrical circuits.
Figure 1: The Mathematical Analysis of Logic by
George Boole
It led to the development of digital electronics
and digital logic. Hence, Dr. Shenon is dubbed
as the ”Father of Information Theory.”
2 Aim
The paper was targetted to understand and sim-
plify control and protective circuits of complex
electrical systems. These circuits required fre-
quent change in the interconnections of relay con-
tacts and switches. Almost eny kind of complex
circuit designed to perform complex operations
automatically had the described issue.
For example, in earlier telephone exchanges,
a telephone operator used to connect calls man-
ually (Fig.2). The work by Dr. Shannon laid a
foundation for the construction of automatic tele-
phone exchanges, making the tedious job faster
and efficient.
Page 2
IIST, Thiruvanthapuram
Figure 2: A telephone operator connecting calls
at a telephone exchange. (Image Source:[2])
3 Method of Attack
In the work, Dr. Shannon developed a calculus
to deal with the mathematical analysis of such
problems. He described the method of attack on
such problems to be, “Any circuit is represented
by a set of equations, the terms of the equations
corresponding to the various relays and switches
in the circuit ” [1].
The developed calculus was used to manipu-
late the equations by simple mathematical pro-
cesses. This calculus was based on the the calcu-
lus of propositions used in study of logic. Equa-
tions are manipulated to reduce them to equa-
tions representing the simplest form of the intial
circuit. The simpler equation can then be drawn
to a circuit.
4 Calculus of Switching Cir-
cuits
4.1 Fundamental Definitions
A Relay contact or Switch must either be open
or closed at any time. A variable Hab which rep-
resents the Hindrance of a two-terminal cir-
cuit a-b was associated with the relay contact or
switch (Fig.3). Now, the variable Hab can attain
two values representing the hindrance of open and
closed circuit. By choice, it was defined Hab = 1
when the circuit is open and Hab = 0 when the
circuit is closed.
Figure 3: Representation of a relay/switch.)
In any electrical circuit, any two component
can be connected in either series or parallel. To
represent the series and parallel connection of the
4 CALCULUS OF SWITCHING CIRCUITS
switching relays and switches, two symbols ‘+’
and ‘.’ were used respectively.
Figure 4: Representation of Series connection of
two relay/switch.)
Addition of two hindrance variables i.e. Hab
+ Ibc represents the series connection of two re-
lay/switch Hab and Ibc (Fig.4).
Figure 5: Representation of Parallel connection
of two relay/switch.)
On the other hand, product of two hindrance
variables i.e. Hab .Iab represents the parallel con-
nection of the two relay/switch Hab and Iab
(Fig.5).
4.2 Fundamental Posthulates
It can be verified that the previously stated defi-
nitions hold true with the following posthulates.
ˆ 0.0 = 0
A closed circuit in parallel with a closed cir-
cuit is a closed circuit.
ˆ 1+1=1
An open circuit in series with an open cir-
cuit is an open circuit.
ˆ 0.1 = 1.0 = 0
A closed circuit in parallel with an open cir-
cuit is a closed circuit.
ˆ 0+1=1+0=1
An open circuit in series with a closed cir-
cuit is an open circuit.
ˆ 0+0=0
A circuit in series with a closed circuit is a
closed circuit.
ˆ 1.1 = 1
An open circuit in parallel with an open cir-
cuit is an open circuit.
4.3 Calculus of Propositions
Based on the algebra of logic developed by George
Boole, the calculus of propositions was developed
to represent propositions. The propositions are
Page 3
IIST, Thiruvanthapuram
limited to two values 0 and 1 i.e. False and True.
This is same as of the calculus of switching cir-
cuits. Further, it was also be proved that the cal-
culus of switching circuits follow the Postulates
of Boolean Algebra by E.V. Huntington [3] same
as of calculus of propositions.
Due to this perfect analogy, any theorem of
the calculus of propositions is also true for the
calculus of switching circuits.
4.4 Theorems
The following theorems governing the combina-
tion of hindrances are given below,
ˆ X + Y = Y + X (1)
ˆ X.Y = Y.X (2)
ˆ X + (Y + Z) = (X + Y ) + Z (3)
ˆ X(Y Z) = (XY )Z (4)
ˆ X(Y + Z) = XY + XZ (5)
ˆ X + Y Z = (X + Y )(X + Z) (6)
ˆ 1.X = X (7)
ˆ 0 + X = X (8)
ˆ 1 + X = 1 (9)
ˆ 0.X = 0 (10)
ˆ X = X + X (11)
ˆ X(X + Y ) = X (12)
ˆ X + X.Y = X (13)
ˆ X.X = X (14)
A new operation ”Negation” can be defined to
inverse of a variable i.e. if the variable is 0, then
the inverse is 1 and vice-versa.
It is denoted as X ′ which is the negation of X.
Then, the following theorems defining teh nega-
tion of a hindrance can be given,
ˆ X + X ′ = 1 (15)
ˆ X.X ′ = 0 (16)
ˆ 0′ = 1 (17)
ˆ 1′ = 0 (18)
ˆ (X ′ )′ = X (19)
ˆ (X + Y + Z)′ = X ′ .Y ′ .Z ′ (20)
ˆ (X.Y.Z)′ = X ′ + Y ′ + Z ′ (21)
5 SERIES-PARALLEL CIRCUIT IIST, Thiruvanthapuram

5 Series-Parallel Circuit The final simplified circuit based on the Equa-

tion 7 is Fig.6.
It was stated that any expression formed with the
operations of addition, multiplication, and nega-
tion represents explicitly a circuit containing only
series and parallel connections. Such a circuit will
be called a series-parallel circuit.

Now, the above stated theorems can be used

to simplify any complicated series-parallel circuit.
For example, Fig.6 shows a series-parallel circuit.
Figure 7: Simplified version of the example series-
parallel circuit

Through the same procedure any of compli-

cated series-parallel circuit can be simplified eas-
ily.

6 Star-Delta Network Trans-

Figure 6: Example of series-parallel circuit formations

The circuit can be simplified to circuit with
minimum number of components with the help
of the above theorems. Here, we have three
branches in all parallel to each other.
Branch 1: Single switch A
Branch 2: Switch B in series with a parallel
combination of A & C (B + A.C)
Branch 3: Switch A in series with C (A + C)
Combining the three branches, we get
As in ordinary network theory, we have star-
to-delta and delta-to-star tensformations in hin-
drance networks. These networks are equiva-
lent and equivalent hindrance of the systems are
equal.
Consider a delta network of three re-
lay/switches Fig.8 and the equivalent star net-
work of it Fig.9.

f = A.(B + A.C).(A + C) (1)

Using theorem (6) and (14),

=⇒ f = (A.B + A.C).(A + C) (2)

Using theorem (6) and (14),

=⇒ f = A.B + A.C + A.B.C + A.C (3)

Using theorem (14),

=⇒ f = A.B + A.B.C + A.C (4)

Taking A.B common from the terms, Figure 8: Example of delta-network circuit

=⇒ f = A.B(1 + C) + A.C (5)

Using theorem (7) and (9) Now, between the terminals a and b, the
equivalent hindrance of the delta network is given
=⇒ f = A.B + A.C (6) as,

Further, taking A common we get,

=⇒ f = A.(B + C) (7) f = A.(B + C) = A.B + A.C (8)

Page 4
7 NON-SERIES-PARALLEL CIRCUITS IIST, Thiruvanthapuram

Figure 9: Equivalent star network circuit of the

above delta-network

Figure 10: Bridge network, an example of non-

Similarly, the equivalent hindrance between
the terminals a and b of the equivalent star-
network is given as,
g = A.B + A.C
series-parallel network
The ac, bc and cd branches forming a star net-
work were converted to the equivalent delta net-
work. We get the following Fig.11
(9)

In the equivalent star-network, the state of the

S.T hindrance doesn’t effect the transmission be-
tween the terminals a and b.

Similary, the equivalence of star-to-delta hin-

drance network can also be proved. These results
are frequently used in simplifying the complex
non-series and parallel circuits.

7 Non-Series-Parallel Cir-
cuits
The author has developed three methods of find-
ing equivalent of non-series-parallel networks. Figure 11: Bridge network after star-to-delta
The circuits are reduced to an equivalent series- transformation
parallel network and then analysed.

The eqivalent hindrance of the circuit in

Fig.11 is given as,
7.1 Method 1: Application of tran-
formations
y = (A.(C + E) + B.(E + D)).(C + D) (10)
Here, the star and delta network transformations
Using Theorem (6),
are applied until the circuit reduces to a series-
parallel form and then the hindrance function is =⇒ y = (A.C+A.E+B.E+B.D).(C+D) (11)
written. Further, it can be simplified to a more
simplier circuit. =⇒ y = A.C + A.E.C + B.E.C + B.D.C + A.C.D + A.E.D + B.E.D + B.D
(12)
For example, a bridge network is a non-series- Using Theorem (6) and (9),
parallel network Fig.10. This network can be
simplified to series-parallel network by applying =⇒ y = A.C + B.E.C + B.D.C + A.C.D + A.E.D + B.D
the star-to-delta transformation at terminal c. (13)

Page 5
7 NON-SERIES-PARALLEL CIRCUITS
=⇒ y = A.C + B.E.C + A.E.D + B.D (14)
Simplifying, we get
=⇒ y = A.C + B.D + E.(B.C + A.D) (15)
Equation (15) gives the simplest form of
equivalent hindrance of a bridge network.
7.2 Method 2
The second method is to find and draw all the
possible paths through the network between the
terminal of interest. Then, the hindrance func-
tion of the circuit is written based on the fact
that if any one of the paths has zero hindrance,
then the whole network will have zero hindrance.
For example, in the bridge circuit shown in
Fig.10, there are four possible paths A + B,
C + D, A + E + D and C + E + B. Combin-
ing the above paths, we get,
y = (A+B).(C+D).(A+E+D).(C+E+B) (16)
Simplifying the expression we get,
=⇒ y = A.C + B.D + E.(B.C + A.D) (17)
Now, Method 2 and Method 1 render the ex-
actly same final equation i.e. Equation (15) and
(17).
7.3 Method 3
The third method is to draw all possible lines
which would break the circuit between the points
of interest, making lines go through the hin-
drances of the circuit. Each line gives a term
which is the product of all the hindrances on the
line. The hindrance function is the sum of all the
such terms.
This method is usually the most convinient
and rapid method. For example, when the
method (Fig.12) is applied on the bridge circuit
in Fig.10. We get a direct expression as,
=⇒ y = A.C + B.D + E.(B.C + A.D) (18)
Page 6
IIST, Thiruvanthapuram
Figure 12: Application of Method 3 in the Bridge
network
7.4 Simultaneous Equations
Simulataneous equations is a system of equations
which completely define the operation of the sys-
tem. The right side of the equations will be
known functions composed of various dependent
and independent variables. Dependent Vari-
ables: Relay and other devices controlled by the
network will be dependent variables. Later let-
ters of alphabets are used to represent the depen-
dent variables. Independent Variables:Relay
or other devices controlled by the sources external
to the circuit under consideration are called inde-
pendent variables. Earlier letters of the alphabets
are used to represent the independent variables.
For example, if a circuit has multiple depen-
dent relays/circuits, then we can use the idea of
simultaneous equations to solve for the dependent
variables in terms of the independent variables.
Further, the circuit can be simplified.
References
[1] Claude E Shannon. “A symbolic analysis of
relay and switching circuits”. In: Electrical
Engineering 57.12 (1938), pp. 713–723.
[2] Wikipedia. Telephone Exchange. Accessed
on 2022-18-06. url: https : / / en .
wikipedia . org / wiki / Telephone _
exchange.
[3] Edward V Huntington. Boolean algebra:
A correction. American Mathematical Soc.,
1933.