104 search results - page 10 / 21 » On Reachability for Hybrid Automata over Bounded Time |
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
PLDI
2010
ACM
14 years 4 months ago
2010
ACM
We define the reachability-bound problem to be the problem of finding a symbolic worst-case bound on the number of times a given control location inside a procedure is visited in ...
CONCUR
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
ATVA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...