2872 search results - page 192 / 575 » On (Omega-)Regular Model Checking |
TSMC
2010
14 years 6 months ago
2010
Traditional planning assumes reachability goals and/or full observability. In this paper, we propose a novel solution for safety and reachability planning with partial observabilit...
CHARME
2001
Springer
15 years 3 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...
109
click to vote
LPNMR
2004
Springer
15 years 4 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...
114
click to vote
AGP
2003
IEEE
15 years 4 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 ...
FMCAD
2000
Springer
15 years 2 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...