线性系统的可达性分析

IF 0.4 4区 计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Shiping Chen, Xinyu Ge
{"title":"线性系统的可达性分析","authors":"Shiping Chen,&nbsp;Xinyu Ge","doi":"10.1007/s00236-024-00458-8","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we propose a decision procedure of reachability for a linear system <span>\\(\\xi '=A\\xi +u\\)</span>, where the matrix <span>\\(A's\\)</span> eigenvalues can be arbitrary algebraic number and the input <i>u</i> is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential polynomial and then achieved by being reduced to verification of a series of univariate polynomial inequalities through Taylor expansions of the related exponential functions and trigonometric functions. If the initial set is open semi-algebraic, we will propose a decision procedure based on OpenCAD and an algorithm of real root isolation derived from the sign-deciding procedure for the trigonometric-exponential polynomials. The experimental results indicate the efficiency of our approach. Under the assumption of Schanuel’s Conjecture, the above procedures are complete for bounded time except for several cases.</p></div>","PeriodicalId":7189,"journal":{"name":"Acta Informatica","volume":"61 3","pages":"231 - 260"},"PeriodicalIF":0.4000,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reachability analysis of linear systems\",\"authors\":\"Shiping Chen,&nbsp;Xinyu Ge\",\"doi\":\"10.1007/s00236-024-00458-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In this paper, we propose a decision procedure of reachability for a linear system <span>\\\\(\\\\xi '=A\\\\xi +u\\\\)</span>, where the matrix <span>\\\\(A's\\\\)</span> eigenvalues can be arbitrary algebraic number and the input <i>u</i> is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential polynomial and then achieved by being reduced to verification of a series of univariate polynomial inequalities through Taylor expansions of the related exponential functions and trigonometric functions. If the initial set is open semi-algebraic, we will propose a decision procedure based on OpenCAD and an algorithm of real root isolation derived from the sign-deciding procedure for the trigonometric-exponential polynomials. The experimental results indicate the efficiency of our approach. Under the assumption of Schanuel’s Conjecture, the above procedures are complete for bounded time except for several cases.</p></div>\",\"PeriodicalId\":7189,\"journal\":{\"name\":\"Acta Informatica\",\"volume\":\"61 3\",\"pages\":\"231 - 260\"},\"PeriodicalIF\":0.4000,\"publicationDate\":\"2024-04-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Acta Informatica\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://link.springer.com/article/10.1007/s00236-024-00458-8\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Acta Informatica","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s00236-024-00458-8","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了线性系统 \(\xi '=A\xi +u/)的可达性决策程序,其中矩阵 \(A's/)特征值可以是任意代数数,输入 u 是三角-指数多项式的向量。如果初始集只包含一个点,那么所考虑的可达性问题就简化为三角-指数多项式符号的可判定性,然后通过相关指数函数和三角函数的泰勒展开,简化为一系列单变量多项式不等式的验证。如果初始集合是开放的半代数,我们将提出一种基于 OpenCAD 的判定程序,以及一种从三角-指数多项式的符号判定程序中衍生出来的实根隔离算法。实验结果表明我们的方法非常有效。在Schanuel猜想的假设下,除了几种情况外,上述程序都能在有界时间内完成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reachability analysis of linear systems

In this paper, we propose a decision procedure of reachability for a linear system \(\xi '=A\xi +u\), where the matrix \(A's\) eigenvalues can be arbitrary algebraic number and the input u is a vector of trigonometric-exponential polynomials. If the initial set contains only one point, the reachability problem under consideration is reduced to the decidability of the sign of trigonometric-exponential polynomial and then achieved by being reduced to verification of a series of univariate polynomial inequalities through Taylor expansions of the related exponential functions and trigonometric functions. If the initial set is open semi-algebraic, we will propose a decision procedure based on OpenCAD and an algorithm of real root isolation derived from the sign-deciding procedure for the trigonometric-exponential polynomials. The experimental results indicate the efficiency of our approach. Under the assumption of Schanuel’s Conjecture, the above procedures are complete for bounded time except for several cases.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Acta Informatica
Acta Informatica 工程技术-计算机:信息系统
CiteScore
2.40
自引率
16.70%
发文量
24
审稿时长
>12 weeks
期刊介绍: Acta Informatica provides international dissemination of articles on formal methods for the design and analysis of programs, computing systems and information structures, as well as related fields of Theoretical Computer Science such as Automata Theory, Logic in Computer Science, and Algorithmics. Topics of interest include: • semantics of programming languages • models and modeling languages for concurrent, distributed, reactive and mobile systems • models and modeling languages for timed, hybrid and probabilistic systems • specification, program analysis and verification • model checking and theorem proving • modal, temporal, first- and higher-order logics, and their variants • constraint logic, SAT/SMT-solving techniques • theoretical aspects of databases, semi-structured data and finite model theory • theoretical aspects of artificial intelligence, knowledge representation, description logic • automata theory, formal languages, term and graph rewriting • game-based models, synthesis • type theory, typed calculi • algebraic, coalgebraic and categorical methods • formal aspects of performance, dependability and reliability analysis • foundations of information and network security • parallel, distributed and randomized algorithms • design and analysis of algorithms • foundations of network and communication protocols.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信