{"title":"A colored Petri net-based formal method for the design of control systems","authors":"M. Makungu, R. St.-Denis, M. Barbeau","doi":"10.1109/CMPSAC.1996.542422","DOIUrl":null,"url":null,"abstract":"Several formal methods model reactive systems as discrete-event systems (DES). This makes mathematical reasoning about their properties easier and controller synthesis possible. We investigate the forbidden state control problem in which a DES is represented as a colored Petri net with a symmetry specification. More specifically, we provide an efficient formal method for synthesizing a controller which, when combined with the original system, will avoid reaching forbidden states. This problem is decidable if the colored Petri net has finite color sets and bounded places. Unlike conventional methods that explore the entire reachable set of states, our method avoids an exhaustive search of the state space by exploiting a symmetry specification. Furthermore, this abstraction technique allows a compact representation for the controller. Therefore, our method performs particularly well when applied to large but structured processes with similar components.","PeriodicalId":306601,"journal":{"name":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 20th International Computer Software and Applications Conference: COMPSAC '96","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CMPSAC.1996.542422","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Several formal methods model reactive systems as discrete-event systems (DES). This makes mathematical reasoning about their properties easier and controller synthesis possible. We investigate the forbidden state control problem in which a DES is represented as a colored Petri net with a symmetry specification. More specifically, we provide an efficient formal method for synthesizing a controller which, when combined with the original system, will avoid reaching forbidden states. This problem is decidable if the colored Petri net has finite color sets and bounded places. Unlike conventional methods that explore the entire reachable set of states, our method avoids an exhaustive search of the state space by exploiting a symmetry specification. Furthermore, this abstraction technique allows a compact representation for the controller. Therefore, our method performs particularly well when applied to large but structured processes with similar components.