DocumentCode :
2198953
Title :
A Transformation Algorithm of Ladder Diagram into Instruction List Based on AOV Digraph and Binary Tree
Author :
Fen, Ge ; Ning, Wu
Author_Institution :
Dept. of Electron. Eng., Nanjing Univ. of Aeronaut. & Astronaut.
fYear :
2006
fDate :
14-17 Nov. 2006
Firstpage :
1
Lastpage :
4
Abstract :
Ladder diagram (LD) and instruction list (IL) have been widely used in industries as programming languages for PLC (programmable logic controller). The LD is similar to the electrical schematic diagram, and can represent control logic explicitly. However, LD programs can not be executed directly by PLC. On the other hand the IL which is similar to the assemble language can be processed directly by PLC. Thus, it is necessary to study transformation algorithm from the LD to the IL. This paper proposes a transformation algorithm used to transform the LD into the IL for PLC systems. The transformation algorithm uses an AOV digraph to represent the LD program, and then realizes the transformation by postorder traversing binary trees built form the AOV digraph. In this paper, first some basic concepts and data structures in the algorithm are presented. Second, this paper describes main ideas and detailed steps of the transformation algorithm. A transformation example in this paper shows that the proposed algorithm is correct and has practicability
Keywords :
directed graphs; programmable controllers; trees (mathematics); binary tree; data structure; digraph theory; ladder diagram; programmable logic controller; transformation algorithm; Assembly; Binary trees; Computer languages; Data structures; Electronics industry; Industrial control; Industrial electronics; Logic programming; Programmable control; Tail;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
TENCON 2006. 2006 IEEE Region 10 Conference
Conference_Location :
Hong Kong
Print_ISBN :
1-4244-0548-3
Electronic_ISBN :
1-4244-0549-1
Type :
conf
DOI :
10.1109/TENCON.2006.343937
Filename :
4142169
Link To Document :
بازگشت