612 search results - page 3 / 123 » Bounded model checking for knowledge and real time |
ATVA
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
TACAS
2010
Springer
14 years 9 days 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...
ATVA
2007
Springer
13 years 9 months ago
2007
Springer
ENTCS
2002
13 years 5 months ago
2002
CONCUR
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. We study the decidability and complexity of verification problems for timed automata over time intervals of fixed, bounded length. One of our main results is that time-bo...