259 search results - page 32 / 52 » Bounded Model Checking for Timed Automata |
127
click to vote
NFM
2011
14 years 6 months ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
ATVA
2006
Springer
15 years 3 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
105
click to vote
FM
2009
Springer
15 years 3 months ago
2009
Springer
We study a clock synchronization protocol for the Chess WSN. First, we model the protocol as a network of timed automata and verify various instances using the Uppaal model checker...
FM
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We propose an approach to automatic verification of realtime systems against scenario-based requirements. A real-time system is modeled as a network of Timed Automata (TA...
QEST
2006
IEEE
15 years 5 months ago
2006
IEEE
The time-bounded reachability problem for continuoustime Markov chains (CTMCs) amounts to determine the probability to reach a (set of) goal state(s) within a given time span, suc...