二元动力系统周期轨迹综合的逻辑方法

G. Oparin, V. Bogdanova, A. A. Pashinin
{"title":"二元动力系统周期轨迹综合的逻辑方法","authors":"G. Oparin, V. Bogdanova, A. A. Pashinin","doi":"10.47350/iccs-de.2021.10","DOIUrl":null,"url":null,"abstract":"A logic method for structural-parametric synthesis of a binary dynamical system with a given periodic trajectory is proposed. This method provides a constructive solution for the considered problem. The attraction region of such a trajectory must coincide with a given subset of the state space. An additional constraint sets the acceptable time for reaching this trajectory from its attraction region. As admissible structures for dynamical models of the synthesis, we consider the following systems: linear systems, systems with the disjunctive and conjunctive right sides. All conditions of the problem are written in the form of a quantified Boolean formula with subsequent verification of its truth using a specialized solver, which gives values of the required parameters of the dynamical model. The software implementation of the proposed method in the form of a composite service is presented. All stages of the parametric synthesis of a Boolean network based on the proposed method are demonstrated in the example of a one-step linear system.","PeriodicalId":210887,"journal":{"name":"International Workshop on Information, Computation, and Control Systems for Distributed Environments","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A logical method for the synthesis of periodic trajectory in a binary dynamical system\",\"authors\":\"G. Oparin, V. Bogdanova, A. A. Pashinin\",\"doi\":\"10.47350/iccs-de.2021.10\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A logic method for structural-parametric synthesis of a binary dynamical system with a given periodic trajectory is proposed. This method provides a constructive solution for the considered problem. The attraction region of such a trajectory must coincide with a given subset of the state space. An additional constraint sets the acceptable time for reaching this trajectory from its attraction region. As admissible structures for dynamical models of the synthesis, we consider the following systems: linear systems, systems with the disjunctive and conjunctive right sides. All conditions of the problem are written in the form of a quantified Boolean formula with subsequent verification of its truth using a specialized solver, which gives values of the required parameters of the dynamical model. The software implementation of the proposed method in the form of a composite service is presented. All stages of the parametric synthesis of a Boolean network based on the proposed method are demonstrated in the example of a one-step linear system.\",\"PeriodicalId\":210887,\"journal\":{\"name\":\"International Workshop on Information, Computation, and Control Systems for Distributed Environments\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-07-24\",\"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.2021.10\",\"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.2021.10","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了一种具有给定周期轨迹的二元动力系统结构参数综合的逻辑方法。这种方法为所考虑的问题提供了建设性的解决方案。这种轨迹的吸引区域必须与状态空间的给定子集重合。另一个约束规定了从吸引区域到达该轨迹的可接受时间。作为综合动力学模型的允许结构,我们考虑了以下系统:线性系统,具有析取和合取右侧的系统。问题的所有条件都以量化布尔公式的形式写成,随后使用专门的求解器验证其正确性,该求解器给出了动态模型所需参数的值。提出了以组合服务形式实现该方法的软件实现。以一步线性系统为例,说明了基于该方法的布尔网络参数综合的各个阶段。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A logical method for the synthesis of periodic trajectory in a binary dynamical system
A logic method for structural-parametric synthesis of a binary dynamical system with a given periodic trajectory is proposed. This method provides a constructive solution for the considered problem. The attraction region of such a trajectory must coincide with a given subset of the state space. An additional constraint sets the acceptable time for reaching this trajectory from its attraction region. As admissible structures for dynamical models of the synthesis, we consider the following systems: linear systems, systems with the disjunctive and conjunctive right sides. All conditions of the problem are written in the form of a quantified Boolean formula with subsequent verification of its truth using a specialized solver, which gives values of the required parameters of the dynamical model. The software implementation of the proposed method in the form of a composite service is presented. All stages of the parametric synthesis of a Boolean network based on the proposed method are demonstrated in the example of a one-step linear system.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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