Homework #4 Solution

8.5 Construct the ladder logic diagrams for the following Boolean logic equations: (a) Y = (X1 +
X2) X3, (b) Y = (X1 + X2) (X3 + X4), (c) Y = (X1 X2) + X3, (d) Y = X1 X2.
Solution:
(a)
X1 X3 Y

X2

(b)
X1 X3 Y

X2 X4

(c)
X1 X2 Y

X3

(d)

1
8.10 In the fluid filling operation of Example 8.6, suppose a sensor (e.g., a submerged float switch)
is used to determine whether the contents of the tank have been evacuated, rather than rely on
timer T2 to empty the tank. (a) Construct the ladder logic diagram for this revised system. (b)
Write the low level language statements for the system using the PLC instruction set in Table
8.11.
Solution:
(a) Assume FS2 (new float switch) is open when tank is empty. FS1 is the tank full float switch.

FS1 C1
X1

C1

S1
C1

FS2 C2
FS1

C2

T1
C2
120 s

T1 S2

(b) Low level language statements:

STR X1
OR C1
AND NOT FS1
OUT C1
STR C1
OUT S1
STR FS1
OR C2
AND NOT FS2
OUT C2
STR C2
TMR T1 120 (120 specifies timer delay in sec)
STR T1
OUT S2

Or, following classroom example:

2
LD X1
OR C1
ANDN FS1
ST C1
ST S1
LD FS1
OR C2
ANDN FS2
ST C2
TMR T1 120
LD T1
ST S2

8.12 An emergency stop system is to be designed for a certain automatic production machine. A
single "start" button is used to turn on the power to the machine at the beginning of the day. In
addition, there are three "stop" buttons located at different locations around the machine, any
one of which can be pressed to immediately turn off power to the machine. (a) Write the truth
table for this system. (b) Write the Boolean logic expression for the system. (c) Construct the
logic network diagram for the system. (d) Construct the ladder logic diagram for the system.
Solution:
Let X1 = start button, X2 = stop button 1, X3 = stop button 2, X4 = stop button 3, Y1 = machine
status, and Y2 = power-to-machine.

(a) Truth table: X1 X2 X3 X4 Y1 Y2

0 0 0 0 0 0
0 0 0 0 1 1
0 0 0 1 0 0
0 0 0 1 1 0
0 0 1 0 0 0
0 0 1 0 1 0
0 0 1 1 0 0
0 1 0 0 0 0
0 1 0 0 1 0
0 1 0 1 0 0
0 1 0 1 1 0
0 1 1 0 0 0
0 1 1 0 1 0
0 1 1 1 0 0
0 1 1 1 1 0
1 0 0 0 0 1
1 0 0 0 1 1
1 0 0 0 1 0
1 0 0 1 0 0
1 0 0 1 1 0

3
 1 0 1 1 1 0
1 1 0 0 0 0
1 1 0 0 1 0
1 1 0 1 0 0
1 1 0 1 1 0
1 1 1 0 0 0
1 1 1 0 1 0
1 1 1 1 0 0
1 1 1 1 1 0

(b) Boolean logic expression:

Y2 = (X1 + Y1) ⋅ ( X2 + X3 + X4) = (X1 + X2) ⋅ X2 ⋅ X3 ⋅ X4

(c) Logic network diagram

X2
X3
X4 Y2 Y1

X1

(d) Ladder logic diagram

X2 X3 X4 Y2
X1

Y2