Abstract
In this paper, we give some new methods for synthesis of controllers of discrete event dynamical systems (DEDS) with partial event informations. Given a regular target language L, we construct some effective computable algorithms for computing the controllable and observable sublanguages of L. We show that any one of these controllable and observable sublanguages obtained by our algorithms is larger than the supremal controllable and normal sublanguage of L.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have