259 search results - page 2 / 52 » Bounded Model Checking for Timed Automata |
FORMATS
2006
Springer
13 years 10 months 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
2007
Springer
14 years 13 days ago
2007
Springer
Dierence Bound Matrices (DBMs) are the most commonly used data structure for model checking timed automata. Since long they are being used in successful tools like Kronos or UPPAA...
FORMATS
2004
Springer
13 years 11 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
CONCUR
1999
Springer
13 years 10 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...
ACSD
2007
IEEE
13 years 8 months ago
2007
IEEE
We present an improvement of the SAT-based Unbounded Model Checking (UMC) algorithm. UMC, a symbolic approach introduced in [7], uses propositional formulas in conjunctive normal ...