2873 search results - page 12 / 575 » Model Checking and the Mu-calculus |
119
Voted
ICFEM
2009
Springer
15 years 1 months ago
2009
Springer
One of the most important open problems of parallel LTL model-checking is to design an on-the-fly scalable parallel algorithm with linear time complexity. Such an algorithm would g...
ECEASST
2010
15 years 1 months ago
2010
146
Voted
TOCL
2011
14 years 11 months ago
2011
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...