Symbolic Reachability Computation for Families of Linear Vector Fields-Reference-Cited by-同舟云学术

Symbolic Reachability Computation for Families of Linear Vector Fields

Published:2001-09 Issue:3 Volume:32 Page:231-253
ISSN:0747-7171
Container-title:Journal of Symbolic Computation
language:en
Short-container-title:Journal of Symbolic Computation

Author:

Lafferriere Gerardo,Pappas George J.,Yovine Sergio

Publisher

Elsevier BV

Subject

Computational Mathematics,Algebra and Number Theory

Reference38 articles.

1. The algorithmic analysis of hybrid systems;Alur;Theor. Comput. Sci.,1995

2. A theory of timed automata;Alur;Theor. Comput. Sci.,1994

3. H. Anai, J. Kaneko, Proceedings of 1999 European Control Conference, ECC’99, 1999, Karlsruhe, Germany

4. H. Anai, V. Weispfenning, Proceedings of International Symposium on Symbolic and Algebraic Computation, ISSAC 2000, 2000, ACM, St Andrews, Scotland

5. Output feedback stabilization and related problems—solution via decision methods;Anderson;IEEE Trans. Autom. Control,1975

Cited by 141 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Practical Approximate Quantifier Elimination for Non-linear Real Arithmetic;Lecture Notes in Computer Science;2024-09-11

2. Fully automated verification of linear time-invariant systems against signal temporal logic specifications via reachability analysis;Nonlinear Analysis: Hybrid Systems;2024-08

3. Reduction of Transcendental Decision Problems over the Reals;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

4. Reachability analysis of linear systems;Acta Informatica;2024-04-09

5. Specification-Compliant Driving Corridors for Motion Planning of Automated Vehicles;IEEE Transactions on Intelligent Vehicles;2023-09