2873 search results - page 12 / 575 » Model Checking and the Mu-calculus |
ICFEM
2009
Springer
13 years 7 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
13 years 7 months ago
2010
ICFEM
2010
Springer
13 years 7 months ago
2010
Springer
TOCL
2011
13 years 5 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...
MEMICS
2010
13 years 4 months ago
2010