{"title":"离散事件系统控制中输出约束转化为事件约束","authors":"Y. Du, S. Wang","doi":"10.1109/CDC.1988.194491","DOIUrl":null,"url":null,"abstract":"The output-constrained language of an automation and a translator that translates output constraint into event constraint are formally defined. An algorithm for the construction of a translator is introduced. This allows output constraint to be used to formulate requirements for a discrete-event system. This formulation is in many cases much easier than using event constraint directly. The algorithm is an O(m*n*k) algorithm, where m is the number of states in the constraint, and k is the number of events. By eliminating the inaccessible states in the translator, a more efficient algorithm can be derived.<<ETX>>","PeriodicalId":113534,"journal":{"name":"Proceedings of the 27th IEEE Conference on Decision and Control","volume":"121 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Translation of output constraint into event constraint in the control of discrete event systems\",\"authors\":\"Y. Du, S. Wang\",\"doi\":\"10.1109/CDC.1988.194491\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The output-constrained language of an automation and a translator that translates output constraint into event constraint are formally defined. An algorithm for the construction of a translator is introduced. This allows output constraint to be used to formulate requirements for a discrete-event system. This formulation is in many cases much easier than using event constraint directly. The algorithm is an O(m*n*k) algorithm, where m is the number of states in the constraint, and k is the number of events. By eliminating the inaccessible states in the translator, a more efficient algorithm can be derived.<<ETX>>\",\"PeriodicalId\":113534,\"journal\":{\"name\":\"Proceedings of the 27th IEEE Conference on Decision and Control\",\"volume\":\"121 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-12-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 27th IEEE Conference on Decision and Control\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CDC.1988.194491\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 27th IEEE Conference on Decision and Control","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CDC.1988.194491","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Translation of output constraint into event constraint in the control of discrete event systems
The output-constrained language of an automation and a translator that translates output constraint into event constraint are formally defined. An algorithm for the construction of a translator is introduced. This allows output constraint to be used to formulate requirements for a discrete-event system. This formulation is in many cases much easier than using event constraint directly. The algorithm is an O(m*n*k) algorithm, where m is the number of states in the constraint, and k is the number of events. By eliminating the inaccessible states in the translator, a more efficient algorithm can be derived.<>
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
