N. Kouvakas, F. Koumboulis, D. Fragkoulis, Konstantinos Markou
{"title":"一种自动化制造系统安全的模块化监控方案","authors":"N. Kouvakas, F. Koumboulis, D. Fragkoulis, Konstantinos Markou","doi":"10.1109/RAAI56146.2022.10093007","DOIUrl":null,"url":null,"abstract":"The analytic finite deterministic automata models of the subsystems of an automated manufacturing system in circular mode are presented. The total model of the manufacturing system is determined. The safety specifications of the system are formulated in the form of rules. The rules are translated to appropriate desired regular languages. The languages are realized in analytic forms of finite deterministic supervisor automata. A modular supervisory control scheme based on the supervisor automata, is proposed. The satisfactory performance of the controlled automaton is proven, through the computation of the marked language of the controlled automaton and the proof the nonblocking property of the controlled automaton as well as the proof of the controllability of the languages, realized by the supervisor automata. The complexity of the proposed supervisor scheme is computed.","PeriodicalId":190255,"journal":{"name":"2022 2nd International Conference on Robotics, Automation and Artificial Intelligence (RAAI)","volume":"84 9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Modular Supervisory Control Scheme for the Safety of an Automated Manufacturing System\",\"authors\":\"N. Kouvakas, F. Koumboulis, D. Fragkoulis, Konstantinos Markou\",\"doi\":\"10.1109/RAAI56146.2022.10093007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The analytic finite deterministic automata models of the subsystems of an automated manufacturing system in circular mode are presented. The total model of the manufacturing system is determined. The safety specifications of the system are formulated in the form of rules. The rules are translated to appropriate desired regular languages. The languages are realized in analytic forms of finite deterministic supervisor automata. A modular supervisory control scheme based on the supervisor automata, is proposed. The satisfactory performance of the controlled automaton is proven, through the computation of the marked language of the controlled automaton and the proof the nonblocking property of the controlled automaton as well as the proof of the controllability of the languages, realized by the supervisor automata. The complexity of the proposed supervisor scheme is computed.\",\"PeriodicalId\":190255,\"journal\":{\"name\":\"2022 2nd International Conference on Robotics, Automation and Artificial Intelligence (RAAI)\",\"volume\":\"84 9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 2nd International Conference on Robotics, Automation and Artificial Intelligence (RAAI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RAAI56146.2022.10093007\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Conference on Robotics, Automation and Artificial Intelligence (RAAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAAI56146.2022.10093007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Modular Supervisory Control Scheme for the Safety of an Automated Manufacturing System
The analytic finite deterministic automata models of the subsystems of an automated manufacturing system in circular mode are presented. The total model of the manufacturing system is determined. The safety specifications of the system are formulated in the form of rules. The rules are translated to appropriate desired regular languages. The languages are realized in analytic forms of finite deterministic supervisor automata. A modular supervisory control scheme based on the supervisor automata, is proposed. The satisfactory performance of the controlled automaton is proven, through the computation of the marked language of the controlled automaton and the proof the nonblocking property of the controlled automaton as well as the proof of the controllability of the languages, realized by the supervisor automata. The complexity of the proposed supervisor scheme is computed.