Reachability analysis of linear systems

DOI10.1007/S00236-024-00458-8MaRDI QIDQ6592109zbMATH OpenFDO

Authors Shiping Chen, Xinyu Ge

Publication date 24 August 2024

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00236-024-00458-8

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A theory of timed automata
• Automated proof of mixed trigonometric-polynomial inequalities
• Automated proving for a class of transcendental-polynomial inequalities
• Automated proving of exponent polynomial inequalities
• Constructing fewer open cells by GCD computation in CAD projection
• Decidability of the reachability for a family of linear vector fields
• Deciding polynomial-exponential problems
• Deciding polynomial-transcendental problems
• How to recognize zero?
• scientific article; zbMATH DE number 3711282 (Why is no real title available?)
• O-minimal hybrid systems.
• On the Skolem problem for continuous linear dynamical systems
• Positive root isolation for poly-powers by exclusion and differentiation
• Quantifier elimination for a class of exponential polynomial formulas
• Reachability analysis of rational eigenvalue linear systems
• Real root isolation for exp-log-arctan functions
• Solving systems of strict polynomial inequalities
• Symbolic reachability computation for families of linear vector fields
• The algorithmic analysis of hybrid systems
• Transcendental numbers. With a foreword by W. Dale Brownawell. Transl. from the Russian by Neal Koblitz
• What's decidable about hybrid automata?

This page was built for publication: Reachability analysis of linear systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6592109)