PCF-based formalization of the parallel composition of automata

A. Davydov, Aleksandr Larionov, N. Nagul
{"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":null,"pages":null},"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}
引用次数: 1

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于pcf的自动机并行组合的形式化
本文论述了如何应用PCF微积分的自动定理证明技术来构造自动机的并行组合。平行构成在监督控制理论和监督设计的不同阶段起着至关重要的作用。改进了离散事件系统的形式化,作为积极构造的公式和辅助谓词,为自动机检查的可及性服务,简化了并行组合结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Investigation of observability property of controlled binary dynamical systems: a logical approach Modular discrete event systems control based on logic inference Information and algorithmic support of a multi-level integrated system for the investment strategies formation Modelling purposeful processes based on the geometric representation of their trajectories End-user development of knowledge bases for semi-automated formation of task cards
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1