Symbolic Model Checking
NuSMV 2: An OpenSource Tool for Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
The Complexity of the Graded µ-Calculus
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
CTL Model-Checking with Graded Quantifiers
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Graded-CTL: Satisfiability and Symbolic Model Checking
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Fundamenta Informaticae - Advances in Computational Logic (CIL C08)
Graded alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Graded CTL model checking for test generation
Proceedings of the 2011 Symposium on Theory of Modeling & Simulation: DEVS Integrative M&S Symposium
Hi-index | 0.00 |
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures In this paper we show an extension of the NuSMV model-checker implementing symbolic algorithms for graded-CTL model checking The implementation is based on the CUDD library, for BDDs and ADDs manipulation, and includes also an efficient algorithm for multiple counterexamples generation.