171 search results - page 3 / 35 » Hypervolume Approximation in Timed Automata Model Checking |
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
FMSD
2006
13 years 5 months ago
2006
Two base algorithms are known for reachability verification over timed automata. They are called forward and backwards, and traverse the automata edges using either successors or p...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Sampled semantics of timed automata is a nite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems ed granularity of ti...
CONCUR
2000
Springer
13 years 10 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 ...
ENTCS
2007
13 years 5 months ago
2007
Bounded Model Checking (BMC) is a successful refutation method to detect errors in not only circuits and other binary systems but also in systems with more complex domains like ti...