Professional Documents
Culture Documents
Et438b-7 PPSX
Et438b-7 PPSX
pptx 1
A manual mixing operation is to be automated using
sequential process control methods. The process
composed of three steps:
et438b-7.pptx 2
Energized
Press start
open Solenoid A
energized
Tank fills to tank begins to
limit fill
open
closed
et438b-7.pptx 3
Let contact state represent a logical value
= Logic 0 Called Form A
Contact
et438b-7.pptx 4
potential grd
output
AB=C Energized
inputs
et438b-7.pptx 5
OR
Function
potential grd
Energized
A + B = C Boolean expression
et438b-7.pptx 6
NOT Function
Boolean Expression
B=A
et438b-7.pptx 7
Combine the AND function with the NOT function to get a NAND operation.
Energized
Any contact
open associated with coil
D will change
De-energized state like a NAND
TTL gate.
Rung 1 implements the AND function
Rung 2 implements the NOT function
et438b-7.pptx 8
Energized
Close AND
open NAND
A B C = E and A B C = E
et438b-7.pptx 9
Can add a memory action to the above by including
a feedback from the output coil to the inputs
Energized
B and
C are
not
sealed
Close
open
et438b-7.pptx 10
Energized
open
Motor
Power Runs
wiring
et438b-7.pptx 12
OR
A OR B OR C
Energize E
OR
output
NOR
output
Typical wiring
Operate
Latched
Reset
Latched
Press A: continuity
2
rung 2 Both loads
on
E1
On 3
Press B: continuity
4 rung 4 Both loads off
1
Load1
Close off
5
Open Load 2
off 6
2
Remember all contacts are drawn with the coils
de-energized
et438b-7.pptx 15
Rung 1: when input
TR-E A is energized timer
On TR-E starts
Sequential Systems
• Follow steps, transition from one step to another.
• Use state transition diagrams or tables with Boolean
Algebra
• State Machine implemented in software or hardware
• Decisions made base on current condition of system and
input information
et438b-7.pptx 18
Boolean Variables False =0 True =1
Boolean
Operators
EOR=XOR
Alternate
Implementation
X A B AB
et438b-7.pptx 19
Axioms of Boolean Algebra
Idempotent Associative Distributive
AA A ( A B ) C A ( B C ) A ( B C ) ( A B ) ( A C )
A A A ( A B ) C A ( B C ) A ( B C ) ( A B ) ( A C )
X A B A B C 1 Use Identity
Axiom
C 1 C
X A B A B C
Simplified Expression
et438b-7.pptx 22
1.) Obtain description of process
2.) Define control action
3.) Define Inputs and Outputs
4.) Develop Truth Table or Boolean Equation of Process
A heating oven with two bays can heat one ingot in each bay.
When the heater is on it provides enough heat for two ingots. If
only one ingot is present, the oven may overheat so a fan is used
to cool the oven when it exceeds a set temperature.
Control Action
When only one ingot is in the oven and the temperature exceeds
the setpoint, turn on the fan
et438b-7.pptx 23
Define I/O variables Inputs: B1 = bay1 ingot present
B2 = bay2 ingot present
T = temperature sensor
T B2 B1 F
0 0 0 0
0 0 1 0 If there is no over temperature
0 1 0 0 don’t start the fan
0 1 1 0
1 0 0 1 Over temperature in empty oven: safety fan start
1 0 1 1
Start fan in lightly load ovens with over temp.
1 1 0 1
1 1 1 1 Over temperature in full oven: safety fan start
et438b-7.pptx 24
Select elements from truth table in SOP (sum-of-
products) form then simplify.
T B2 B1 F F T B 1 B 2 T B 1 B 2 T B 1 B 2 T B 1 B 2
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 0
1 0 0 1
F T (B1 B2 B1 B2 B1 B2 B1 B2)
1 0 1 1 F T (B2 (B1 B1) B2 (B1 B1))
1 1 0 1
F T (B2 B2)
1 1 1 1
FT Requires only Temp
control
Ignore unloaded and full load cases and try again
et438b-7.pptx 25
F T B 1 B 2 T B 1 B 2
Revised Truth Table
T B2 B1 F
F T ( B1 B 2 B1 B 2 )
0 0 0 0
0 0 1 0
0 1 0 0
Ladder Logic Representation
0 1 1 0
1 0 0 0
1 0 1 1 B1 B2
1 1 0 1
T F
1 1 1 0
B1 B2
et438b-7.pptx 26
Avoid multiple complemented variables in
ladder logic (No NAND, NOR)
NAND NOR
X A B A B X A B A B
et438b-7.pptx 27
Definitions
State - current operational mode of system
et438b-7.pptx 28
When a set of inputs (conditions) become valid for
leaving a state, the system is directed to the
destination state
State exit
input To other
conditions states
Current Next
State State
State State
entry input outputs
conditions
et438b-7.pptx 29
State transition diagrams allow designers to examine the
interaction between desired conditions and find their logical
relationships and sequence. Use in digital computer design
Else
B Else
State
A
State 2
1 State
Else
If C true go to State 1 3
Else State 3
C
et438b-7.pptx 30
Informal: State X =(State X +Arrival from another state) and has not left
for another state
Re-seti,= logical condition to
State State
reset state variable i and leave
n m
setn resetm
. .
. .
State State State
j seti i reseti k
. .
. .
. set2 reset2 .
State State
2 set1 reset1 2
m
state i set (state j , I)i reset (state i , I) k
n
1
state i
j1 k 1
Reset
out i h i (state 1 , state 2 ,...state N ) Conditions
Functions of
Where: state and
statei = a variable that reflects state i is on inputs
statei+1 = next value of state variable
outi = desired outputs of state i
hi( ) = output function of state variables
n = number of transitions into state i
m = number of transitions out of state i
N = total number of system states
seti= logical condition to set state variable i
reseti = logical condition to reset state variable i
et438b-7.pptx 32
Write the state equation for a motor starting control described in the state
diagram below with the following input and outputs
I0=pressed stop button (PB1)
S1 I1= pressed start button (PB2)
I1 (Start) I2 = motor overload condition (OL)
X1=1
X11 X1 I1 I0 I2 M O1 X1
X1 M
M (M PB2) PB1 OL
Construct
I0 PB 1 Stop
Ladder I1 PB2 Start
I2 OL Overload
START
PB2
M
STOP
OL
PB1
et438b-7.pptx 34
A work piece must travel back and forth on a conveyor. The location
of the work piece is determined by two limit switches. When the
location is detected control signal are sent to a reversing motor
contactor. The machine is started and stopped from a local set of
push button switches. Develop a ladder logic diagram to implement
this control.
et438b-7.pptx 35
Determine the inputs, outputs and states of system
Inputs: I0: press start
I1: press stop
I2: Table at reverse limit (1LS)
I3: Table at forward limit (2LS)
Outputs:
O0: Start motor forward (2CR)
O1: Start motor reverse (3CR)
I3 I2
States:
O0 S0: off
I0 S1: on-forward,
I1 S2: on reverse,
O1
et438b-7.pptx 36
Assume machine starts at reverse limit. (1LS changes state)
T1, 2 I3
T0,1 I0
S1
(on-
forward) T2,1 I2
T1,0 I1 S2
(on-
reverse)
S0
(Stop)
O0 start forward
action
I0: press start
I1: press stop O1 start reverse
I2: Table at reverse limit (1LS) action
I3: Table at forward limit (2LS)
et438b-7.pptx 37
Define set and reset conditions
Define 2 state variables X1 and X2 set X1 I0 I2 X2
X2 X1 Condition reset X1 I1 I3
0 0 Off (S0)
set X 2 I3 X1
0 1 On-Forward (S1)
reset X 2 I2
1 0 On-Reverse (S2)
1 1 Not allowed X11 (X1 set x1 )( reset x1 )
X11 (X1 (I0 I2 X2))( I1 I3)
T0,1 I0 T1, 2 I3
S1
(on-
X11 (X1 (I0 I2 X2))( I1 I3)
forward)
T2,1 I2
T1,0 I1 X 2 1 (X 2 set x 2 )( reset x 2 )
X1=1 S2
S0
(Stop) X2=0
(on-
reverse)
X 2 1 (X 2 I3 X1)( I2)
O0
O1 Outputs X1 O0, X2 O1
X1=0
X2=1
et438b-7.pptx 38
Convert state equations into ladder diagram 2CR = O0
3CR =O1
2CR 1 (2CR Start 1LS 3CR )(Stop 2LS) I0=start
3CR 1 (3CR 2LS 2CR )(1LS) I1=stop
1LS I2=1LS
I3=2LS
3CR
STOP
2LS
START 2CR
2CR
1LS 2LS
2CR 3CR
3CR
et438b-7.pptx 39
Systems with multiple entries and exits from a state require blocking of
Alternatives.
D S2
S0 B
Two Choices
IF A THEN block C
IF C THEN block A
C A given priority to C
A S1
S0 1 (S0 A S1) (B S0)
S11 (S1 (B S0 D S2)) (A S1 C S1)
S2 1 (S2 C S1 A) (D S2)
A or C can occur independently to exit S1.
Must give one transition priority over other. C over A
Block setting of conflicting state S0 1 (S0 A S1 C) (B S0)
S2 1 (S2 C S1) (D S2)
et438b-7.pptx 40
FS
A ( C D)
S1
S0 BA
FE
E(C D F)
Inputs Outputs Write state equations
A P for this system. Give state S2
B Q S2 priority over S0
C R
D T01 (A(C D)) S0
E
F Output Map T10 (F E) S1
FS State P Q R T1 FS
S0 0 1 1 T12 B A S1
S1 1 0 1 T21 (E(C D F)) S2
S2 1 1 0
et438b-7.pptx 41
Write state equations using transitions
et438b-7.pptx 42