Sciweavers

554 search results - page 14 / 111
» Approximate Probabilistic Model Checking
Sort
View
FORMATS
2007
Springer
14 years 1 months ago
Hypervolume Approximation in Timed Automata Model Checking
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...
Víctor A. Braberman, Jorge Lucángeli...
WIA
2009
Springer
14 years 2 months ago
TAGED Approximations for Temporal Properties Model-Checking
Roméo Courbis, Pierre-Cyrille Héam, ...
DATE
2003
IEEE
100views Hardware» more  DATE 2003»
14 years 24 days ago
Improving SAT-Based Bounded Model Checking by Means of BDD-Based Approximate Traversals
: Binary Decision Diagrams (BDDs) have been widely used in synthesis and verification. Boolean Satisfiability (SAT) Solvers, on the other hand, have been gaining
Gianpiero Cabodi, Sergio Nocco, Stefano Quer
ERSHOV
2003
Springer
14 years 21 days ago
Polynomial Approximations for Model Checking
Nikolay V. Shilov, Natalya Olegovna Garanina
ENTCS
2006
122views more  ENTCS 2006»
13 years 7 months ago
Algorithmic Algebraic Model Checking III: Approximate Methods
Venkatesh Mysore, Bud Mishra