131 search results - page 3 / 27 » Model Checking Prioritized Timed Automata |
FORMATS
2006
Springer
14 years 7 days ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...
FORMATS
2004
Springer
14 years 1 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 8 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...
ENTCS
2007
13 years 8 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...
LICS
2009
IEEE
14 years 3 months ago
2009
IEEE
