123 search results - page 4 / 25 » Optimizing Bounded Model Checking for Linear Hybrid Systems |
112
click to vote
CAV
2003
Springer
15 years 5 months ago
2003
Springer
We show that the model checking problem for µ-calculus on graphs of bounded tree-width can be solved in time linear in the size of the system. The result is presented by first sh...
121
click to vote
HYBRID
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we study the identifiability of linear switched systems (LSSs ) in discrete-time. The question of identifiability is central to system identification, as it sets the...
122
Voted
LFCS
2007
Springer
15 years 6 months ago
2007
Springer
We present a general algorithm scheme for model checking logics of knowledge, common knowledge and linear time, based on simulations to a class of structures that capture the way t...
FM
2009
Springer
15 years 7 months ago
2009
Springer
In Bounded Model Checking both the system model and the checked property are translated into a Boolean formula to be analyzed by a SAT-solver. We introduce a new encoding technique...
122
click to vote
TABLEAUX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...