1246 search results - page 20 / 250 » Recursive Timed Automata |
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
2004
Springer
14 years 24 days 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 ...
QEST
2008
IEEE
14 years 1 months ago
2008
IEEE
In [3] a probabilistic semantics for timed automata has been defined in order to rule out unlikely (sequences of) events. The qualitative model-checking problem for LTL propertie...
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
Whereas formal verification of timed systems has become a very active field of research, the idealised mathematical semantics of timed automata cannot be faithfully implemented. Se...
LICS
2003
IEEE
14 years 20 days ago
2003
IEEE
We consider several questions related to the use of digitization techniques for timed automata. These very successful techniques reduce dense-time language inclusion problems to d...