333 search results - page 3 / 67 » On the complexity of partial order trace model checking |
CONCUR
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
TACAS
2010
Springer
14 years 2 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...
SNPD
2008
13 years 9 months ago
2008
Testing cannot cover all execution schedules in concurrent software. Model checking, however, is capable of verifying the outcome of all possible executions. It has been applied s...
CAV
2004
Springer
14 years 27 days ago
2004
Springer
ACTA
2010
13 years 7 months ago
2010
