104 search results - page 2 / 21 » On Reachability for Hybrid Automata over Bounded Time |
WOLLIC
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. In this paper, we present a three-valued property driven model checking algorithm for the logic CTL on hybrid automata. The technique of multivalued model checking for hy...
HYBRID
2007
Springer
13 years 11 months ago
2007
Springer
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...
HYBRID
2001
Springer
13 years 9 months ago
2001
Springer
FORMATS
2005
Springer
13 years 10 months ago
2005
Springer
Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of h...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
Priced Probabilistic Timed Automata (PPTA) extend timed automata with cost-rates in locations and discrete probabilistic branching. The model is a natural combination of Priced Tim...