{"title":"有限状态逻辑系统的广义语言测度","authors":"I. Chattopadhyay, A. Ray","doi":"10.1109/WODES.2006.382395","DOIUrl":null,"url":null,"abstract":"The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems. This paper reports several generalizations of the language measure, which are applicable to synthesis of optimal discrete event supervisory control. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples","PeriodicalId":285315,"journal":{"name":"2006 8th International Workshop on Discrete Event Systems","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Generalized Language Measure of Finite State Logical Systems\",\"authors\":\"I. Chattopadhyay, A. Ray\",\"doi\":\"10.1109/WODES.2006.382395\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems. This paper reports several generalizations of the language measure, which are applicable to synthesis of optimal discrete event supervisory control. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples\",\"PeriodicalId\":285315,\"journal\":{\"name\":\"2006 8th International Workshop on Discrete Event Systems\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 8th International Workshop on Discrete Event Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WODES.2006.382395\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 8th International Workshop on Discrete Event Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WODES.2006.382395","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Generalized Language Measure of Finite State Logical Systems
The signed real measure of regular languages has been introduced and validated in recent literature for quantitative analysis and synthesis of discrete-event supervisory (DES) control systems. This paper reports several generalizations of the language measure, which are applicable to synthesis of optimal discrete event supervisory control. These generalizations eliminate a user-selectable parameter in the original concept of language measure. The concepts are illustrated with simple examples
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
