259 search results - page 1 / 52 » Bounded Model Checking for Timed Automata |
ENTCS
2007
13 years 4 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...
TACAS
2010
Springer
13 years 12 months ago
2010
Springer
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
Probabilistic timed automata are an extension of timed automata with discrete probability distributions. We consider model-checking algorithms for the subclasses of probabilistic t...
ENTCS
2002
13 years 4 months ago
2002
FMSD
2006
13 years 4 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...