4341 search results - page 237 / 869 » Quantitative Model checking |
89
Voted
AAAI
2000
15 years 2 months ago
2000
The SciFinance
CHARME
2001
Springer
15 years 4 months ago
2001
Springer
Model checking is the process of verifying whether a model of a concurrent system satisfies a specified temporal property. Symbolic algorithms based on Binary Decision Diagrams (BD...
124
click to vote
LPNMR
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
133
click to vote
AGP
2003
IEEE
15 years 6 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
107
Voted
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...