57 search results - page 1 / 12 » Bounded Reachability for Temporal Logic over Constraint Syst... |
39
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
98
Voted
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
103
Voted
SEFM
2009
IEEE
15 years 7 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
100
Voted
CADE
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
91
Voted
ATVA
2010
Springer
15 years 1 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...