{"title":"基于pcf的推理构造DES规范的可控子语言","authors":"A. Davydov, Aleksandr Larionov, N. Nagul","doi":"10.47350/iccs-de.2020.06","DOIUrl":null,"url":null,"abstract":"The paper considers how methods of a logical inference search in the calculus\nof positively constructed formulas may be applied to represent and study discrete event systems. The formalisms of discrete event systems and positively constructed formulas are briefly described. A method for constructing a product of automata using constructive inference in the positively constructed formulas calculus is proposed. Based on the given specication on\nthe behaviour of the system, a method for constructing a supremal controllable sublanguage of the specication is presented.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The construction of controllable sublanguage of specification for DES via PCFs based inference\",\"authors\":\"A. Davydov, Aleksandr Larionov, N. Nagul\",\"doi\":\"10.47350/iccs-de.2020.06\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper considers how methods of a logical inference search in the calculus\\nof positively constructed formulas may be applied to represent and study discrete event systems. The formalisms of discrete event systems and positively constructed formulas are briefly described. A method for constructing a product of automata using constructive inference in the positively constructed formulas calculus is proposed. Based on the given specication on\\nthe behaviour of the system, a method for constructing a supremal controllable sublanguage of the specication is presented.\",\"PeriodicalId\":210887,\"journal\":{\"name\":\"International Workshop on Information, Computation, and Control Systems for Distributed Environments\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-07-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Information, Computation, and Control Systems for Distributed Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.47350/iccs-de.2020.06\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47350/iccs-de.2020.06","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The construction of controllable sublanguage of specification for DES via PCFs based inference
The paper considers how methods of a logical inference search in the calculus
of positively constructed formulas may be applied to represent and study discrete event systems. The formalisms of discrete event systems and positively constructed formulas are briefly described. A method for constructing a product of automata using constructive inference in the positively constructed formulas calculus is proposed. Based on the given specication on
the behaviour of the system, a method for constructing a supremal controllable sublanguage of the specication is presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
