Sciweavers

359 search results - page 6 / 72
» Reachability for Continuous and Hybrid Systems
Sort
View
HYBRID
1995
Springer
13 years 11 months ago
Deciding Reachability for Planar Multi-polynomial Systems
Abstract. In this paper we investigate the decidability of the reachability problem for planar non-linear hybrid systems. A planar hybrid system has the property that its state spa...
Karlis Cerans, Juris Viksna
HYBRID
2007
Springer
14 years 1 months ago
Composing Semi-algebraic O-Minimal Automata
This paper addresses questions regarding the decidability of hybrid automata that may be constructed hierarchically and in a modular way, as is the case in many exemplar systems, b...
Alberto Casagrande, Pietro Corvaja, Carla Piazza, ...
HYBRID
2001
Springer
14 years 7 days ago
Minimum-Cost Reachability for Priced Timed Automata
Gerd Behrmann, Ansgar Fehnker, Thomas Hune, Kim Gu...
HYBRID
2009
Springer
14 years 2 months ago
Finite Automata as Time-Inv Linear Systems Observability, Reachability and More
We show that regarding finite automata (FA) as discrete, time-invariant linear systems over semimodules, allows to: (1) express FA minimization and FA determinization as particula...
Radu Grosu
HYBRID
1999
Springer
14 years 21 hour ago
A New Class of Decidable Hybrid Systems
Abstract. One of the most important analysis problems of hybrid systems is the reachability problem. State of the art computational tools perform reachability computation for timed...
Gerardo Lafferriere, George J. Pappas, Sergio Yovi...