Abstract
Maze algorithm can identify connected relation of a single node in ladder diagram of programmable logical controller, from which serial or parallel connections between pairs of attached nodes derive. After uniting serial or parallel relation of each node, serial or parallel connections of all nodes are stored in binary trees. Scanning binary trees can generate instruction lists. Maze algorithm identifies the connected relation of ladder diagram node correctly and ensures the correctness of translating ladder diagram into instruction lists.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
