352 search results - page 7 / 71 » On the optimal reachability problem of weighted timed automa... |
HYBRID
2001
Springer
13 years 12 months ago
2001
Springer
TACAS
1999
Springer
13 years 11 months ago
1999
Springer
We consider the problem of computing concrete diagnostics for timed automata and reachability properties. Concrete means containing information both about the discrete state change...
CAV
2006
Springer
13 years 11 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
VMCAI
2010
Springer
14 years 4 months ago
2010
Springer
We present uniform approaches to establish complexity bounds for decision problems such as reachability and simulation, that arise naturally in the verification of timed software s...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...