5 search results - page 1 / 1 » Deciding Reachability for Planar Multi-polynomial Systems |
HYBRID
1995
Springer
13 years 8 months ago
1995
Springer
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...
HYBRID
2001
Springer
13 years 9 months ago
2001
Springer
SAC
2010
ACM
13 years 11 months ago
2010
ACM
Analysis of systems containing both discrete and continuous dynamics, hybrid systems, is a difficult issue. Most problems have been shown to be undecidable in general, and decidab...
HYBRID
1997
Springer
13 years 9 months ago
1997
Springer
Abstract. The theory of formal verification is one of the main approaches to hybrid system analysis. Decidability questions for verification algorithms are obtained by constructi...
FORMATS
2006
Springer
13 years 8 months ago
2006
Springer
Polygonal hybrid systems (SPDI) are a subclass of planar hybrid automata which can be represented by piecewise constant differential inclusions. The reachability problem as well as...