Abstract

A method for solving the forbidden state problem in the Supervisory Control Theory framework is presented. In many real-world applications both the plant and specification is given as a set of interacting automata or processes. In this work, we enable specification of forbidden states within such a modular structure. The aim with the method is to make each forbidden modular state combination uncontrollable. It is then possible to use efficient modular synthesis algorithms for calculation of a modular supervisor where the forbidden states are removed.

Full Text
Published version (Free)

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