25 search results - page 1 / 5 » Unbounded, Fully Symbolic Model Checking of Timed Automata u... |
96
Voted
CAV
2003
Springer
15 years 3 months ago
2003
Springer
84
Voted
ACSD
2007
IEEE
15 years 2 days 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 ...
83
Voted
CAV
2003
Springer
15 years 3 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
108
Voted
FORMATS
2004
Springer
15 years 3 months ago
2004
Springer
Probabilistic timed automata are timed automata extended with discrete probability distributions, and can be used to model timed randomised protocols or faulttolerant systems. We ...
104
Voted
FORMATS
2006
Springer
15 years 1 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 ...