Benjamin Brandenbourger, Milan Vathoopan, Alois Zoitl
{"title":"建模和验证自动化系统的行为约束","authors":"Benjamin Brandenbourger, Milan Vathoopan, Alois Zoitl","doi":"10.1109/INDIN.2017.8104796","DOIUrl":null,"url":null,"abstract":"A technical plant behavior using a functional description forms the basis for common understanding of different disciplines and is used for the draft of hardware and software. Correlations between specific functions of the automation components and system can be allowed or denied in the behavior model describing the tended reaction. This contribution proposes an approach for modeling and verifying formal behavioral constraints of automation systems. The approach is realized either with finite state machines or with regular expressions. Furthermore, this work presents a methodology to convert verbalized constraints into finite state machines or regular expressions. The approach is evaluated by means of a pick & place unit.","PeriodicalId":6595,"journal":{"name":"2017 IEEE 15th International Conference on Industrial Informatics (INDIN)","volume":"25 1","pages":"345-350"},"PeriodicalIF":0.0000,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modeling and verifying behavioral constraints for automation systems\",\"authors\":\"Benjamin Brandenbourger, Milan Vathoopan, Alois Zoitl\",\"doi\":\"10.1109/INDIN.2017.8104796\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A technical plant behavior using a functional description forms the basis for common understanding of different disciplines and is used for the draft of hardware and software. Correlations between specific functions of the automation components and system can be allowed or denied in the behavior model describing the tended reaction. This contribution proposes an approach for modeling and verifying formal behavioral constraints of automation systems. The approach is realized either with finite state machines or with regular expressions. Furthermore, this work presents a methodology to convert verbalized constraints into finite state machines or regular expressions. The approach is evaluated by means of a pick & place unit.\",\"PeriodicalId\":6595,\"journal\":{\"name\":\"2017 IEEE 15th International Conference on Industrial Informatics (INDIN)\",\"volume\":\"25 1\",\"pages\":\"345-350\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 15th International Conference on Industrial Informatics (INDIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/INDIN.2017.8104796\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 15th International Conference on Industrial Informatics (INDIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDIN.2017.8104796","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Modeling and verifying behavioral constraints for automation systems
A technical plant behavior using a functional description forms the basis for common understanding of different disciplines and is used for the draft of hardware and software. Correlations between specific functions of the automation components and system can be allowed or denied in the behavior model describing the tended reaction. This contribution proposes an approach for modeling and verifying formal behavioral constraints of automation systems. The approach is realized either with finite state machines or with regular expressions. Furthermore, this work presents a methodology to convert verbalized constraints into finite state machines or regular expressions. The approach is evaluated by means of a pick & place unit.