104 search results - page 7 / 21 » On Reachability for Hybrid Automata over Bounded Time |
124
click to vote
HYBRID
1998
Springer
15 years 6 months ago
1998
Springer
We continue investigation of languages, accepted by timed automata of Alur and Dill. In [ACM97] timed regular expressions equivalent to timed automata were introduced. Here we intr...
109
click to vote
AUTOMATICA
2008
15 years 1 months ago
2008
In this work, probabilistic reachability over a finite horizon is investigated for a class of discrete time stochastic hybrid systems with control inputs. A suitable embedding of ...
138
Voted
ICALP
1997
Springer
15 years 6 months ago
1997
Springer
Rectangular hybrid automatamodel digital control programs of analog plant environments. We study rectangular hybrid automatawhere the plant state evolves continuously in real-numbe...
134
click to vote
HYBRID
2005
Springer
15 years 7 months ago
2005
Springer
We study the class of lazy linear hybrid automata with finite precision. The key features of this class are: – The observation of the continuous state and the rate changes assoc...
121
click to vote
ACSD
2007
IEEE
15 years 3 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...