2878 search results - page 193 / 576 » Model Checking FTA |
152
Voted
LPNMR
2004
Springer
15 years 8 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...
157
Voted
AGP
2003
IEEE
15 years 8 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 ...
138
click to vote
FMCAD
2000
Springer
15 years 7 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...
141
click to vote
FORMATS
2009
Springer
15 years 10 months ago
2009
Springer
Embedded real-time systems are typically programmed in low-level languages which provide support for event-driven task processing and real-time interrupts. We show that the model c...
149
Voted
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
We present a method of distributed model checking of multiagent systems specified by a branching-time temporal-epistemic logic. We introduce a serial algorithm, central to the dis...