Abstract
Recently, several approaches for the study of fuzzy discrete event systems (FDES) in a supervisory control context have been proposed. Although controllability of fuzzy languages and their implementation by a supervisor could be verified by algorithmic procedures, the problem of supervisor synthesis was only solved for the case of FDES with crisp states but fuzzy state transitions. In this paper, we present algorithms to compute the supremal controllable fuzzy sublanguage and the infimal controllable prefix-closed fuzzy superlanguage of a given fuzzy language for the general case of FDES with fuzzy states, fuzzy state transitions and fuzzy event controllability properties, and formally prove their correctness.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
