Supervisory Control of Fuzzy Discrete Event Systems: A Formal Approach
Daowen Qiu

TL;DR
This paper advances the supervisory control theory for fuzzy discrete event systems by establishing controllability theorems, analyzing complexity, and providing computational methods for different fuzzy automata models.
Contribution
It introduces a formal framework for supervisory control of fuzzy DESs, including controllability conditions, complexity analysis, and practical algorithms for max-product and max-min automata.
Findings
Controllability and nonblocking theorems established for fuzzy DESs.
Complexity analysis for fuzzy controllability testing methods.
Algorithms for checking fuzzy controllability in max-product and max-min automata.
Abstract
Fuzzy {\it discrete event systems} (DESs) were proposed recently by Lin and Ying [19], which may better cope with the real-world problems with fuzziness, impreciseness, and subjectivity such as those in biomedicine. As a continuation of [19], in this paper we further develop fuzzy DESs by dealing with supervisory control of fuzzy DESs. More specifically, (i) we reformulate the parallel composition of crisp DESs, and then define the parallel composition of fuzzy DESs that is equivalent to that in [19]; {\it max-product} and {\it max-min} automata for modeling fuzzy DESs are considered; (ii) we deal with a number of fundamental problems regarding supervisory control of fuzzy DESs, particularly demonstrate controllability theorem and nonblocking controllability theorem of fuzzy DESs, and thus present the conditions for the existence of supervisors in fuzzy DESs; (iii) we analyze the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
