0% found this document useful (0 votes)
4 views1 page

Structure Text Programming - Codesys 15

The document summarizes structured text programming, highlighting variables, functions, and syntax, along with differences between standard and Allen Bradley implementations. It includes a traffic light example to demonstrate a ControlLogix application. Additionally, it presents practice problems for writing structured text programs to replace ladder logic and implement Boolean equations.

Uploaded by

edlistianto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views1 page

Structure Text Programming - Codesys 15

The document summarizes structured text programming, highlighting variables, functions, and syntax, along with differences between standard and Allen Bradley implementations. It includes a traffic light example to demonstrate a ControlLogix application. Additionally, it presents practice problems for writing structured text programs to replace ladder logic and implement Boolean equations.

Uploaded by

edlistianto
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

343

19.4 SUMMARY

• Structured text programming variables, functions, syntax were discussed.


• The differences between the standard and the Allen Bradley implementation were indicated as
appropriate.
• A traffic light example was used to illustrate a ControlLogix application

19.5 PRACTICE PROBLEMS

1. Write a structured text program that will replace the following ladder logic.
A active
EQU MOV
Source A 20 Source -2
Source B n Dest n
A LEQ
Source A n active
Source B 20
active

active
ADD
Source A n
Source B 2
Dest n
LOG
Source n
Dest x

SUB
Source A x
Source B 1
Dest x
MUL
Source A x
Source B 2
Dest x

2. Implement the following Boolean equations in a Structured Text program. If the program was for a state
machine what changes would be required to make it work?

light = ( light + dark • switch ) • switch • light

dark = ( dark + light • switch ) • switch • dark

You might also like