# Understanding of logic in ladder program with its transformation into sequential graph using state space-based approach

##### Citations

1 citations

### Cites methods from "Understanding of logic in ladder pr..."

...[5] take an approach based on the extraction of all possible states from the Ladder Diagram, creating a state space that can be trimmed by simple heuristic rules defined by the user....

[...]

### Cites background or methods from "Understanding of logic in ladder pr..."

...They also refer [2], stating that developing temporal models and the arbitrary selection of initial state "hamper the use of this approach for any pratical problem" [19]....

[...]

...[19] Considering the previous example (figure 2....

[...]

...3 Extraction of implicit sequential logic with state-space based approach The third algorithm, by Nandhan & Babu [19], is a state-space based, computing-driven approach....

[...]

...Nandhan & Babu [19] refer the work of Falcione & Krogh [3], stating that the algorithm is not mature to deal with pratical cases....

[...]

...The algorithm can be broken in three parts [19]:...

[...]