2875 search results - page 297 / 575 » Model checking agentspeak |
129
Voted
ATVA
2004
Springer
15 years 7 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
137
Voted
ATVA
2010
Springer
15 years 4 months ago
2010
Springer
Probabilistic B (pB) [2, 8] extends classical B [7] to incorporate probabilistic updates together with the specification of quantitative safety properties. As for classical B, prob...
149
Voted
CIIA
2009
15 years 4 months ago
2009
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
149
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
rexample Guided Abstraction-Refinement Framework for Markov Decision Processes ROHIT CHADHA and MAHESH VISWANATHAN Dept. of Computer Science, University of Illinois at Urbana-Champ...
99
Voted
FMSD
2006
15 years 3 months ago
2006
We propose a refinement approach to language emptiness, which is based on the enumeration and the successive refinements of SCCs on over-approximations of the exact system. Our alg...