plc boolean - 6.

24

Truth tables can represent all of the possible state of a system.

6.7 PRACTICE PROBLEMS

1. Is the ladder logic in the figure below for an AND or an OR gate?

2. Draw a ladder diagram that will cause output D to go true when switch A and switch B are
closed or when switch C is closed.
3. Draw a ladder diagram that will cause output D to be on when push button A is on, or either B
or C are on.
4. Design ladder logic for a car that considers the variables below to control the motor M. Also
add a second output that uses any outputs not used for motor control.
- doors opened/closed (D)
- keys in ignition (K)
- motor running (M)
- transmission in park (P)
- ignition start (I)
5. a) Explain why a stop button must be normally closed and a start button must be normally open.
b) Consider a case where an input to a PLC is a normally closed stop button. The contact used in
the ladder logic is normally open, as shown below. Why are they both not the same? (i.e., NC
or NO)
start

stop
motor

motor

6. Make a simple ladder logic program that will turn on the outputs with the binary patterns when

plc boolean - 6.25

the corresponding buttons are pushed.

OUTPUTS
INPUTS
H G

F E

D C

B A

1
1
1

0
1
0

0
0
0

0
0
1

1
0
0

1
0
1

1
0
1

1
1
1

Input X on
Input Y on
Input Z on

7. Convert the following Boolean equation to the simplest possible ladder logic.
X = A (A + A B )
8. Simplify the following boolean equations.
a)

A ( B + AB )

b)

A ( B + AB )

c)

A ( B + AB )

d)

A ( B + AB )

9. Simplify the following Boolean equations,

a)
(A + B) (A + B)
b)

ABCD + ABCD + ABCD + ABCD

10. Simplify the Boolean expression below.

( ( A B ) + ( B + A )) C + ( B C + B C )
11. Given the Boolean expression a) draw a digital circuit and b) a ladder diagram (do not simplify), c) simplify the expression.
X = A B C + ( C + B)
12. Simplify the following Boolean equation and write corresponding ladder logic.
Y = ( ABCD + ABCD + ABCD + ABCD ) + D
13. For the following Boolean equation,
X = A + B ( A + CB + DAC ) + ABCD
a) Write out the logic for the unsimplified equation.

plc boolean - 6.26

b) Simplify the equation.

c) Write out the ladder logic for the simplified equation.
14. a) Write a Boolean equation for the following truth table. (Hint: do this by writing an expression for each line with a true output, and then ORing them together.)
A
B
C
D
Result
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1

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

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

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

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

b) Write the results in a) in a Boolean equation.

c) Simplify the Boolean equation in b)
15. Simplify the following Boolean equation, and create the simplest ladder logic.

Y =

C A

+ ( BC ( A +

BC ) )

16. Simplify the following boolean equation with Boolean algebra and write the corresponding
ladder logic.
X = ( A + B A ) + ( C + D + EC )
17. Convert the following ladder logic to a Boolean equation. Then simplify it, and convert it back

plc boolean - 6.27

to simpler ladder logic.

A

18. a) Develop the Boolean expression for the circuit below.

b) Simplify the Boolean expression.
c) Draw a simpler circuit for the equation in b).
A
B
C
X

B
A
C

19. Given a system that is described with the following equation,

X = A + (B (A + C ) + C) + A B (D + E )
a) Simplify the equation using Boolean Algebra.
b) Implement the original and then the simplified equation with a digital circuit.
c) Implement the original and then the simplified equation in ladder logic.
20. Simplify the following and implement the original and simplified equations with gates and
ladder logic.
A + (B + C + D ) (B + C) + A B (C + D )

6.8 PRACTICE PROBLEM SOLUTIONS

1. AND

plc boolean - 6.28

2.
A

3.
B

4.
I

M
K

where,
B = the alarm that goes "Bing" to warn that the keys are still in the car.
5. a) If a NC stop button is damaged, the machine will act as if the stop button was pushed and
shut down safely. If a NO start button is damaged the machine will not be able to start.)
b) For the actual estop which is NC, when all is ok the power to the input is on, when there is a
problem the power to the input is off. In the ladder logic an input that is on (indicating all is ok)

plc boolean - 6.29

will allow the rung to turn on the motor, otherwise an input that is off (indicating a stop) will
break the rung and cut the power.)
6.
H

ETC....

7.
A

8.
a) AB

b)

A+B

c) AB

d)

A+B

plc boolean - 6.30

9.
a)

b)

( A + B ) ( A + B ) = ( AB ) ( AB ) = 0

ABCD + ABCD + ABCD + ABCD = BCD + ABD = B ( CD + AD )

10. C
11.
X = B (A C + C )
12.
Y = ( ABCD + ABCD + ABCD + ABCD ) + D
Y = ( ABCD + ABCD + ABCD + ABCD )D
Y = ( 0 + ABCD + 0 + 0 )D
Y = ABCD
A

plc boolean - 6.31

13.
A

a)
B

b)

A + DCB
A

c)
D

X
C

plc boolean - 6.32

D
C

A
D
B
C

14.

ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD

BCD + ACD + BCD + ABD + BCD + ACD + ABC
BCD + CD ( A + A ) + CD ( B + B ) + ABD + ABC
BCD + D ( C + AB ) + ABC

plc boolean - 6.33

15.

Y = C A + A + ( BC ( A + BC ) )

Y = C A + A + ( BC ( A + B + C ) )
Y = C A + ( A + ( BCABC ) )
Y = C A + ( A + 0 )
Y = C(A + (A + 1))

Y = C(A + ( 1) )

Y = C(A + 0 )
Y = CA
Y = C+A
16.
X = ( A + B A ) + ( C + D + EC )

X = ( A + B A ) + ( C + D + EC )
OR

X = ( A + B A ) ( C + D + EC )

X = A + B A + CD ( E + C )

X = ( A ) ( B A ) ( C + D + EC )

X = A + B + CDE

X = ( A ) ( B A ) ( C + D + EC )
X = AB ( C + D + EC )
X = AB ( C + D + E )

X = AB ( CDE )
X = AB ( C + D + E )

plc boolean - 6.34

17.
D

A
Y

18.
CAB
C
A

B
A

plc boolean - 6.35

19.
a)

X = A + (B (A + C) + C ) + A B (D + E )
X = A + (B A + B C + C) + A B D + A B E
X = A (1 + B D + B E) + B A + C (B + 1)
X = A+BA+C

b)

ABCD E

plc boolean - 6.36

c)

A
C
C

D
E
X

A
B

20.
A + (B + C + D ) (B + C) + A B (C + D )
A (1 + B (C + D) ) + (B + C + D ) B + (B + C + D ) C
A + (C + D ) B + C
A+CB+DB+C
A+DB+C

plc boolean - 6.37

A+DB+C
A
B
C
D
B
C
C
D
A
B

D
B
A
C

6.9 ASSIGNMENT PROBLEMS

1. Simplify the following Boolean equation and implement it in ladder logic.
X = A + BA + BC + D + C

2. Convert the following ladder logic to a Boolean equation. Simplify the equation using Boolean

plc boolean - 6.38

algebra, and then convert the simplified equation back to ladder logic.
C

D
X

3. Use Boolean equations to develop simplified ladder logic for the following truth table where A,
B, C and D are inputs, and X and Y are outputs.

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

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

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

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

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

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

plc boolean - 6.39

4. Convert the truth table below to a Boolean equation, and then simplify it. The output is X and
the inputs are A, B, C and D.
A

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

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

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

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

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

5. Simplify the following Boolean equation. Convert both the unsimplified and simplified equations to ladder logic.
X = ( ABC ) ( A + BC )