Professional Documents
Culture Documents
Instrument Handbook
Instrument Handbook
(2003)
The intent is to pass along to the reader the best and latest
thinking on this subject at this point in time.
ISA FUNCTIONAL DIAGRAMMING (EX-SAMA)*
Instrument and Control Systems Functional Diagramming
Symbol tables are given for use in preparing instrument and
control loop functional diagrams, which are not normally
shown on process flow diagrams (PFDs) and piping and instrument diagrams (P&IDs). They are used to depict monitoring
and control loops in functional instrument diagrams, functional
logic diagrams, application software diagrams, sketches, and
text. They shall be prepared from the following:
a) Instrument line symbols
b) Instrument functional diagramming symbols
c) Mathematical function block symbols
Equivalent P&ID Loop, Functional Instrument
and Electrical Diagrams
See statement of permission in the footnote below.
a) P&ID loop schematic:
LT
71
LSH
01
LIC
01
LSL
01
Start
HS
01B-1
SP
FT
Stop
HS
01B-2
H-O-A
01
FIC
01
HS
01A
FV
01
01
FO
31
2003 by Bla Liptk
32
General Considerations
FT
*01
*01
A
N
D
H/ L
A
K
HS*1A
A
N
D
Auto
OR
NOT
NOT
I
HS*1B-1
HS*1B-2
A
N
D
Start
Start Pump
A
N
D
Stop
Overload
A
N
D
OR
NOT
R
Reset
F(x)
START
HS-01B-1
M1
STOP
HS-01B-2
LSL-01
OL
HS-01A
M2
LSH-01
33
TABLE 1.2a
Functional Diagramming SymbolsInstrument and Mathematical Functions (proposed for the next revision
of ISA S5.1 [now ANSI/ISA-5.01.01] at the time of this writing)
No.
Symbol
Description
01
Measuring device
Input device
Readout device
Output device
Symbols from Tables 1.1h through 1.1k may be used
02
Automatic controller
Single-mode controller
Discrete device driver
Insert function symbols, as required to define controller algorithm, from Table 1.2c
Use for vertical diagramming
03
Automatic controller
Two-mode controller
Insert function symbols, as required to define controller algorithm, from Table 1.2c
Use for vertical diagramming
04
Automatic controller
Three-mode controller
Insert function symbols, as required to define controller algorithm, from Table 1.2c
Use for vertical diagramming
05
06
Automatic controller
Two-mode controller
Insert function symbols, as required to define controller algorithm, from Table 1.2c
Use for horizontal diagramming
07
Automatic controller
Two-mode controller
Insert function symbols, as required to define controller algorithm, from Table 1.2c
Use for horizontal diagramming
08
09
10
11
12
34
General Considerations
TABLE 1.2b
Instrument and Control System Functional Diagramming SymbolsBinary Logic, Memory, and Time Functions (proposed for the next
revision of ISA S5.1 [now ANSI/ISA-5.01.01] at the time of this writing)
No.
Symbol/Truth Table
Definition/Graph
01
A
B
C
AND gate.
Output is true only if all inputs are true.
A
N
D
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
1
02
1
0
A
B
C
X
O
t
1
10
11
12 13
14
15
16
OR gate.
Output is true if any input true.
A
B
C
OR
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
35
Symbol/Truth Table
03
A
B
C
Definition/Graph
Qualified OR gate with greater than or equal to qualifications.
Output equals 1 if number of inputs equal to 1 are greater than or equal to n inputs.
Truth table and graph are for n equals 2.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
0
0
0
0
1
1
1
1
1
1
1
1
1
1
1
04
A
B
C
>n
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
0
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
(Continued)
36
General Considerations
Symbol/Truth Table
05
A
B
C
Definition/Graph
Qualified OR gate with less than or equal to qualifications.
Output equals 1 if number of inputs equal to 1 are less than or equal to n inputs.
Truth table and graph are for n equals 2.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
1
1
1
1
1
1
1
1
1
1
0
0
0
0
0
06
A
B
C
<n
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
1
1
1
1
0
0
0
0
0
0
0
0
0
0
0
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
37
Symbol/Truth Table
07
A
B
C
=n
Definition/Graph
Qualified OR gate with equal to qualifications.
Output equals 1 if inputs equal to 1 are equal to n inputs.
Truth table and graph are for n equals 2.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
08
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
A
B
C
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
0
0
0
0
1
1
1
1
1
1
0
0
0
0
0
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
A
0
1
0
0
0
1
1
1
0
0
0
1
1
1
0
1
B
0
0
1
0
0
1
0
0
1
1
0
1
1
0
1
1
C
0
0
0
1
0
0
1
0
1
0
1
1
0
1
1
1
x
0
0
0
0
1
0
0
1
0
1
1
0
1
1
1
1
O
0
1
1
1
1
0
0
0
0
0
0
1
1
1
1
1
1
0
A
B
C
X
O
t
1
10
11
12
13
14
15
16
(Continued)
38
General Considerations
Symbol/Truth Table
09
NOT
A
1
0
O
0
1
Definition/Graph
NOT gate.
Output is false if input is true.
Output is true if input is false.
A
1
0
1
0
t
1
10
A
1
2
3
4
5
6
7
8
A
0
1
0
0
0
1
0
1
B
0
0
0
1
0
1
0
1
C
0
1
1
0
0
1
1
0
D
1
0
0
1
1
0
0
1
So
1
2
3
4
5
6
7
8
A
0
1
0
0
0
1
0
1
B
0
0
0
1
0
1
0
1
C
0
1
1
0
0
1
1
1
D
1
0
0
1
1
0
0
0
10
11
12
13
14
15
16
1
0
B
C
D
t
2
A
B
C
D
t
1
1
11
Basic memory.
Outputs C and D are always opposite.
If input A equals 1, then output C equals 1, and D equals 0.
If input A changes to 0, output C remains 1 until input B equals 1, then C equals 1, and D equals 0.
If input B equals 1, then output D equals 1, and C equals 0.
If input B changes to 0, output D remains 1 until input A equals 1, then D equals 1, and C equals 0.
If inputs A and B are simultaneously equal to 1, then outputs C and D change state.
39
Symbol/Truth Table
A
Ro
1
2
3
4
5
6
7
8
A
0
1
0
0
0
1
0
1
B
0
0
0
1
0
1
0
1
C
0
1
1
0
0
0
0
0
Definition/Graph
Reset dominant memory (Ro dominant).
Outputs C and D are always opposite.
If input A equals 1, then output C equals 1, and D equals 0.
If input A changes to 0, output C remains 1 until input B equals 1, then output C equals 1, and
D equals 0.
If input B equals 1, then output D equals 1, and C equals 0.
If input B changes to 0, output D remains 1 until input A equals 1, then output D equals 1, and
C equals 0.
If inputs A and B are simultaneously equal to 1, then C equals 0, and D equals 1.
D
1
0
0
1
1
1
1
1
1
0
A
B
C
D
t
1
13
I
PD
NONE
1
0
O
t
t
t
14
I
DT
Off-time delay.
Output O changes from 0 to 1 when input I changes from 0 to 1.
Output O changes from 1 to 0 after input I changes from 1 to 0 and has been equal to 0 for
time duration t.
NONE
1
0
O
t
t
t
(Continued)
40
General Considerations
Symbol/Truth Table
15
I
GT
Definition/Graph
On-time delay.
Output O changes from 0 to 1 after input I changes from 0 to 1 and I remains 1 for prescribed
time duration t.
Output O remains 1 until
a. Input I changes to 0.
b. Reset R changes to 1.
NONE
1
0
R
16
I
LT
NONE
1
0
R
See statement of permission on page 31.
41
TABLE 1.2c
Mathematical Function Block Symbols (proposed for the next revision of ISA S5.1 [now ANSI/ISA-5.01.01] at the time of this writing)
No.
01
Symbol/Function
Equation/Graph
Definition
Output equals the algebraic sum of inputs.
M = X 1 + X 2 .+ X n
Xn
X1
Summation
X2
02
/n
M = X1 + X2
. +
X n/n
M
X1
X2
X3
Average
03
M = X1 X2
X1
X2
Difference
t
04
M = X1 X2
X1
M
X2
Multiplication
t1
05
t1
M = X1 / X2
X1
M
X2
Division
t1
06
2
X
M=X
t1
Square
t
07
M= X
Exponential
t
(Continued)
42
General Considerations
Symbol/Function
Equation/Graph
X
M=
Definition
Output is equal to the square root of the input.
Square Root
t
09
M=
X
X
M
nth Root
t
10
K or P
M = KX
X
Proportional
t1
11
-K or -P
t1
M = KX
t1
Reverse
Proportional
M
t
t1
12
or I
M = (1/TI )
X
Output varies with the magnitude and time duration of the input.
Output is proportional to the time integral of the input.
TI, the integral time constant.
X dt
M
Integral
t1
13
d/dt or D
t2
t1
t2
M = T D (dX/dt)
X
Derivative
t1
14
(X)
t1
M = (X)
X
Unspecified
Function
t
43
Symbol/Function
(t)
Equation/Graph
Definition
Output equals a nonlinear or unspecified time function times the
input.
Output is a nonlinear or unspecified time function.
M = X(t)
X
Time Function
t1
16
>
t1
M = X 1 for X 1 X 2 , M = X 2 for X 1 X 2
X
X1
X2
High Select
t1
17
<
M = X 1 for X 1
X
t1
X 2 , M = X 2 for X 1 X 2
X1
X2
Low Select
t1
18
>
t1
M = X1 for X1 H, M = X2 for X1 H
X
High Limit
t
t1
19
<
t1
M = X1 for X1 L, M = X2 for X1 L
X
Low Limit
t1
20
V
Velocity Limiter
t1
Output equals input as long as the input rate of change does not
exceed the limit value that establishes the output rate of change
until the output again equals the input.
dM/dt=H
t1
t2
t1
t2
(Continued)
44
General Considerations
Symbol/Function
Equation/Graph
Definition
Output is equal to input plus an arbitrary value.
M=X+b
Positive Bias
t
X
t
M
22
M=Xb
Negative Bias
t
X
t
M
25
I = P, P = I, etc.
Conversion
26
(State 1) M = 0 @ X < H
(State 2) M = 1 @ X
X
High Signal
Monitor
X
State
1
t1
27
L
Low Signal
Monitor
State
2
t1
(State 1) M = 0 @ X H
(State 2) M = 1 @ X >
X
M
X
State State
1
2
45
Symbol/Function
Equation/Graph
HL
Definition
Output states are dependent on value of input.
Output changes state when input is equal to or lower than an
arbitrary low limit or equal to or higher than an arbitrary high limit.
(State 1) M = 1 @ X L
(State 2) M = 0 @ L < X < H
(State 3) M = 1 @ X
X
High/Low Signal
Monitor
M
X
State
1
State
2
State
3
L
t
29
(State 1) M = X1
(State 2) M = X2
X
X1
Transfer
State
2
State
1
X2