39 search results - page 3 / 8 » Automatic Abstraction Refinement for Timed Automata |
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
FUIN
2010
13 years 4 months ago
2010
Abstract. Cellular automata have rich computational properties and, at the same time, provide plausible models of physics-like computation. We study decidability issues in the phas...
FAABS
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. The design of reactive systems must comply with logical correctness (the system does what it is supposed to do) and timeliness (the system has to satisfy a set of tempora...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We consider the problem of automatically verifying realtime systems with continuously distributed random delays. We generalise probabilistic timed automata introduced in ...
FORMATS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Quantitative verification techniques are able to establish system properties such as "the probability of an airbag failing to deploy on demand" or "the exp...