Skip to main content
Conference ProceedingsOPEN ACCESS

A NuSMV extension for graded-CTL model checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2010) 6174 LNCS 670-673
DOI: 10.1007/978-3-642-14295-6_58
1Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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. © 2010 Springer-Verlag.

Cite

CITATION STYLE

APA

Ferrante, A., Memoli, M., Napoli, M., Parente, M., & Sorrentino, F. (2010). A NuSMV extension for graded-CTL model checking. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6174 LNCS, pp. 670–673). https://doi.org/10.1007/978-3-642-14295-6_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free