2873 search results - page 12 / 575 » Model Checking and the Mu-calculus |
100
click to vote
ICFEM
2009
Springer
14 years 11 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...
68
Voted
ECEASST
2010
14 years 11 months ago
2010
125
click to vote
TOCL
2011
14 years 8 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...
139
Voted
MEMICS
2010
14 years 8 months ago
2010