Research Article
Design of Logic Controllers Thanks to Symbolic Computation of Simultaneously Asserted Boolean Equations
Table 1
Futures concerning a same case study.
| ā | Formal requirements | Synthesized controller | PLC program (structured text) |
| Supervisory Control Theory | Plant behavior: 11 finite automata (481 states and 1330 transitions) Specifications: 11 finite automata | Finite automaton of 45 states and 70 transitions | 130 lines | Algebraic synthesis | 8 equations and 2 priority rules | 2 6-variable switching functions | 4 lines |
|
|