ISPSoft User Manual
ISPSoft User Manual ISPSoft User Manual
Chapter 12 Sequential Function Chart Final scans are important procedures during the execution of a sequential function chart. After the execution of an action stops, the system will automatically execute a procedure to disable all the outputs in the action. If a final scan is executed, the coils driven by the instruction OUT will be OFF, the application instructions and the function blocks will not executed, the timers will be reset, the states of the coils driven by the instruction SET or RESET will remain unchanged, the counters will stop counting, the states of the contacts of the counters will remain unchanged, and the values in the counters will remain unchanged. Action0 in the figure below is an action associated with STEP_0, and is an N action. When STEP_0 is deactivated and STEP_1 is activated, the system executes a final scan. STEP_0 in the figure below is activated. M10 in Action0 is ON, and therefore M0 is ON, M1 is set to ON, M2 is reset to OFF, the value in T0 is 30, and the value in C0 is 5. STEP_1 in the figure below is activated. Although M10 is ON, M0 is OFF, and T0 is reset. The state of M1, the state of M2, and the value in C0 remain unchanged. 12-5
ISPSoft User Manual 12.2.2 Transitions When a transition is true, the active step immediately before the transition becomes inactive and the step immediately after the transition becomes active. A transition can be true anytime, but for a transition to activate the step following it, the step preceding it must be active when the transition is true. In ISPSoft, a transition can be a Boolean device or symbol, or a program code. If a transition is a logical operation, users can create a transition program, and assign the program to the transition. The transition programs which are created are listed in the project management area. The programming languages which can be used to create transition programs include ladder diagrams, instruction lists, function block diagrams, and structured texts. The Boolean state in a transition program must be sent to a symbol name which is the same as the transition program name, whether the programming language used to create the transition program is a ladder diagram, an instruction list, a function block diagram, or a structured text. The symbol does not need to be declared. However, if there is a symbol name in a symbol table which is the same as a transition program name, an error occurs when the program is compiled. Besides, applied instructions and function blocks can not be used in a transition program, but comparison contacts and block logic instructions (NP, PN, and INV) can be used in a transition program. If the programming language used to create a transition program is a ladder diagram, the program code of the transition program must be composed of one network, and the output contact must be assigned a symbol name which is the same as the transition program name. Besides, multiple outputs are not allowed in a transition program created by means of a ladder diagram. 12-6
- Page 326 and 327: Chapter 9 Function Block Diagram If
- Page 328 and 329: Chapter 9 Function Block Diagram Ri
- Page 330 and 331: Chapter 10 Instruction List Table o
- Page 332 and 333: Chapter 10 Instruction List The ope
- Page 334 and 335: Chapter 10 Instruction List • As
- Page 336 and 337: Chapter 10 Instruction List If user
- Page 338 and 339: Chapter 10 Instruction List Users
- Page 340 and 341: Chapter 10 Instruction List 10.2.4.
- Page 342 and 343: Chapter 11 Structured Text Table of
- Page 344 and 345: Chapter 11 Structured Text A comple
- Page 346 and 347: Chapter 11 Structured Text Data for
- Page 348 and 349: Chapter 11 Structured Text However,
- Page 350 and 351: Chapter 11 Structured Text Example
- Page 352 and 353: Chapter 11 Structured Text Example
- Page 354 and 355: Chapter 11 Structured Text Example
- Page 356 and 357: Chapter 11 Structured Text 11.2.5 L
- Page 358 and 359: Chapter 11 Structured Text 11.2.7 A
- Page 360 and 361: Chapter 11 Structured Text Example
- Page 362 and 363: Chapter 11 Structured Text larger t
- Page 364 and 365: Chapter 11 Structured Text 11.3.3 I
- Page 366 and 367: Chapter 11 Structured Text 11.4 Exa
- Page 368 and 369: Chapter 11 Structured Text Create t
- Page 370 and 371: Chapter 11 Structured Text which is
- Page 372 and 373: Chapter 12 Sequential Function Char
- Page 374 and 375: Chapter 12 Sequential Function Char
- Page 378 and 379: Chapter 12 Sequential Function Char
- Page 380 and 381: Chapter 12 Sequential Function Char
- Page 382 and 383: Chapter 12 Sequential Function Char
- Page 384 and 385: Chapter 12 Sequential Function Char
- Page 386 and 387: Chapter 12 Sequential Function Char
- Page 388 and 389: Chapter 12 Sequential Function Char
- Page 390 and 391: Chapter 12 Sequential Function Char
- Page 392 and 393: Chapter 12 Sequential Function Char
- Page 394 and 395: Chapter 12 Sequential Function Char
- Page 396 and 397: Chapter 12 Sequential Function Char
- Page 398 and 399: Chapter 12 Sequential Function Char
- Page 400 and 401: Chapter 12 Sequential Function Char
- Page 402 and 403: Chapter 12 Sequential Function Char
- Page 404 and 405: Chapter 12 Sequential Function Char
- Page 406 and 407: Chapter 12 Sequential Function Char
- Page 408 and 409: Chapter 12 Sequential Function Char
- Page 410 and 411: Chapter 12 Sequential Function Char
- Page 412 and 413: Chapter 13 Auxiliary Editing Tools
- Page 414 and 415: Chapter 13 Auxiliary Editing Tools
- Page 416 and 417: Chapter 13 Auxiliary Editing Tools
- Page 418 and 419: Chapter 13 Auxiliary Editing Tools
- Page 420 and 421: Chapter 13 Auxiliary Editing Tools
- Page 422 and 423: Chapter 13 Auxiliary Editing Tools
- Page 424 and 425: Chapter 13 Auxiliary Editing Tools
<strong>ISPSoft</strong> <strong>User</strong> <strong>Manual</strong><br />
12.2.2 Transitions<br />
When a transition is true, the active step immediately before the transition becomes inactive and the<br />
step immediately after the transition becomes active. A transition can be true anytime, but for a<br />
transition to activate the step following it, the step preceding it must be active when the transition is<br />
true.<br />
In <strong>ISPSoft</strong>, a transition can be a Boolean device or symbol, or a program code. If a transition is a<br />
logical operation, users can create a transition program, and assign the program to the transition.<br />
The transition programs which are created are listed in the project management area.<br />
The programming languages which can be used to create transition programs include ladder<br />
diagrams, instruction lists, function block diagrams, and structured texts. The Boolean state in a<br />
transition program must be sent to a symbol name which is the same as the transition program<br />
name, whether the programming language used to create the transition program is a ladder diagram,<br />
an instruction list, a function block diagram, or a structured text. The symbol does not need to be<br />
declared. However, if there is a symbol name in a symbol table which is the same as a transition<br />
program name, an error occurs when the program is compiled. Besides, applied instructions and<br />
function blocks can not be used in a transition program, but comparison contacts and block logic<br />
instructions (NP, PN, and INV) can be used in a transition program.<br />
If the programming language used to create a transition program is a ladder diagram, the program<br />
code of the transition program must be composed of one network, and the output contact must be<br />
assigned a symbol name which is the same as the transition program name. Besides, multiple<br />
outputs are not allowed in a transition program created by means of a ladder diagram.<br />
12-6