2488 search results - page 212 / 498 » An improvement in formal verification |
100
click to vote
ATAL
2006
Springer
15 years 5 months ago
2006
Springer
We present an OBDD-based methodology for verifying time, knowledge, and strategies in multi-agent systems specified by the formalism of interpreted systems. To this end, we invest...
103
click to vote
DATE
2004
IEEE
15 years 5 months ago
2004
IEEE
We propose a new arithmetic reasoning calculus to speed up a SAT solver based on the Davis Putnam Longman Loveland (DPLL) procedure. It is based on an arithmetic bit level descrip...
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
OperettA is a graphical tool that supports the design, verification and simulation of OperA models. It ensures consistency between different design parts, provides a formal specif...
AIPS
2006
15 years 2 months ago
2006
In AI Planning, as well as Verification, a successful method is to compile the application into boolean satisfiability (SAT), and solve it with state-of-the-art DPLL-based procedu...
139
click to vote
IPL
2008
15 years 1 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...