Sciweavers

5216 search results - page 215 / 1044
» Planning as Model Checking
Sort
View
TOCL
2011
87views more  TOCL 2011»
15 years 1 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
FMSD
2011
236views Formal Methods» more  FMSD 2011»
14 years 10 months ago
Automatic analysis of DMA races using model checking and k-induction
Alastair F. Donaldson, Daniel Kroening, Philipp R&...