基于pcf的自动机并行组合的形式化

International Workshop on Information, Computation, and Control Systems for Distributed Environments Pub Date : 2019-08-21 DOI:10.47350/iccs-de.2019.03

A. Davydov, Aleksandr Larionov, N. Nagul

{"title":"基于pcf的自动机并行组合的形式化","authors":"A. Davydov, Aleksandr Larionov, N. Nagul","doi":"10.47350/iccs-de.2019.03","DOIUrl":null,"url":null,"abstract":"The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"PCF-based formalization of the parallel composition of automata\",\"authors\":\"A. Davydov, Aleksandr Larionov, N. Nagul\",\"doi\":\"10.47350/iccs-de.2019.03\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.\",\"PeriodicalId\":210887,\"journal\":{\"name\":\"International Workshop on Information, Computation, and Control Systems for Distributed Environments\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-08-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.2019.03\",\"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.2019.03","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文论述了如何应用PCF微积分的自动定理证明技术来构造自动机的并行组合。平行构成在监督控制理论和监督设计的不同阶段起着至关重要的作用。改进了离散事件系统的形式化，作为积极构造的公式和辅助谓词，为自动机检查的可及性服务，简化了并行组合结构。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

PCF-based formalization of the parallel composition of automata

The paper demonstrates how the automatic theorem proving technique of the PCF calculus is applied to construct parallel composition of automata. Parallel composition plays an essential role in the supervisory control theory at different stages of systems and supervisors design. Improved formalization of discrete event systems as positively-constructed formulas along with auxiliary predicates, serving for accessibility of the automaton checking, simplify parallel composition construction.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

International Workshop on Information, Computation, and Control Systems for Distributed Environments

自引率

0.00%

发文量