Symbolic Reachability Computation for Families of Linear Vector Fields
Authors:
- Gerardo LafferriereGLGerardo Lafferriere
- George J. PappasGPGeorge J. Pappas
- Sergio YovineSergio Yovine
- 1 September 2001
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 32 (3) , 231-253
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Testing Stability by Quantifier EliminationJournal of Symbolic Computation, 1997
- Robust Multi-Objective Feedback Design by Quantifier EliminationJournal of Symbolic Computation, 1997
- Nonlinear Control System Design by Quantifier EliminationJournal of Symbolic Computation, 1997
- REDLOGACM SIGSAM Bulletin, 1997
- The algorithmic analysis of hybrid systemsTheoretical Computer Science, 1995
- Symbolic Model Checking for Real-Time SystemsInformation and Computation, 1994
- A theory of timed automataTheoretical Computer Science, 1994
- Partial Cylindrical Algebraic Decomposition for quantifier eliminationJournal of Symbolic Computation, 1991
- Cylindrical Algebraic Decomposition I: The Basic AlgorithmSIAM Journal on Computing, 1984
- Output feedback stabilization and related problems-solution via decision methodsIEEE Transactions on Automatic Control, 1975