Efficient Synthesis of a Class of Discrete-Event Controllers for Forced Actions

Abstract

This paper deals with the synthesis of discrete-event controllers forcing at most one control action in each stage of the control pattern. Supervisory Control Theory (SCT) is employed as the basis modifying the controllability and completeness concepts. BDD-encoded algorithms are presented to carry out all the calculations for synthesizing a controller of this nature. Two examples show the use of the synthesis framework, highlighting its advantages, disadvantages and differences with SCT as well as the performance of the BDD-encoded algorithms. The examples also illustrate how the proposed framework can help to maintain the modeling simple and to synthesize controllers that otherwise could not be obtained.