{"title":"Discussion on: Decentralized Supervisory Control of Fuzzy Discrete Event Systems","authors":"Yongzhi Cao","doi":"10.3166/ejc.14.244-246","DOIUrl":null,"url":null,"abstract":"The paper by Liu and Qiu is concerned with the decentralized supervisory control problem for fuzzy discrete event systems (FDESs) with partial and fuzzy observations. On the one hand, this work is a natural continuation of the authors’ paper [8] in which the centralized control under fuzzy observations was discussed; on the other hand, it is a good extension and complement to some related results in [1]. In terms of the decentralized supervisory control, the key point of divergence between the paper and [1] is that the former allows observations to be fuzzy. The fuzziness of observations, originally suggested by Lin and Ying in [4,5], seems an interesting feature of FDESs and desires formal study. In addition to introducing several necessary definitions, the main technical contributions of the paper are a decentralized supervisory control theorem and a computing approach to verifying the fuzzy coobservability condition in this theorem. The theorem shows that there exist non-blocking local fuzzy supervisors if and only if the fuzzy language to be synthesized is fuzzy controllable, fuzzy co-observable, and closed. Determining the existence of local fuzzy supervisors appeals to methods for checking the fuzzy controllability and the fuzzy co-observability. The paper develops a feasible way to test the fuzzy coobservability condition, since another method for checking the fuzzy controllability condition has already been introduced in [7]. Such a way is highly dependent on the max-min fuzzy automaton modeling of FDESs. More explicitly, it is the max-min operator in the model that makes the number of all states reachable from any state in a system finite, which clearly facilitates the use of computing tree.","PeriodicalId":11813,"journal":{"name":"Eur. J. Control","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2008-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eur. J. Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3166/ejc.14.244-246","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
The paper by Liu and Qiu is concerned with the decentralized supervisory control problem for fuzzy discrete event systems (FDESs) with partial and fuzzy observations. On the one hand, this work is a natural continuation of the authors’ paper [8] in which the centralized control under fuzzy observations was discussed; on the other hand, it is a good extension and complement to some related results in [1]. In terms of the decentralized supervisory control, the key point of divergence between the paper and [1] is that the former allows observations to be fuzzy. The fuzziness of observations, originally suggested by Lin and Ying in [4,5], seems an interesting feature of FDESs and desires formal study. In addition to introducing several necessary definitions, the main technical contributions of the paper are a decentralized supervisory control theorem and a computing approach to verifying the fuzzy coobservability condition in this theorem. The theorem shows that there exist non-blocking local fuzzy supervisors if and only if the fuzzy language to be synthesized is fuzzy controllable, fuzzy co-observable, and closed. Determining the existence of local fuzzy supervisors appeals to methods for checking the fuzzy controllability and the fuzzy co-observability. The paper develops a feasible way to test the fuzzy coobservability condition, since another method for checking the fuzzy controllability condition has already been introduced in [7]. Such a way is highly dependent on the max-min fuzzy automaton modeling of FDESs. More explicitly, it is the max-min operator in the model that makes the number of all states reachable from any state in a system finite, which clearly facilitates the use of computing tree.