CTL model checking algorithm using mapreduce

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Model checking is a promising automated verification technique. The state space explosion is the major difficulty of model checking. To deal with this problem, researchers present a new model checking algorithm for the temporal logic CTL based on MapReduce framework. And the algorithm's data structure is defined for the Kripke structure. This MapReduce algorithm outputs the set of states of the model that satisfies the formula by giving a model and a CTL formula. Researchers justify its correctness by an example with the EU formula. Finally, an example illustrates the validity of this algorithm, and the result shows this method is feasible. © 2013 Springer Science+Business Media New York.

Author supplied keywords

Cite

CITATION STYLE

APA

Guo, F., Wei, G., Deng, M., & Shi, W. (2013). CTL model checking algorithm using mapreduce. In Lecture Notes in Electrical Engineering (Vol. 236 LNEE, pp. 341–348). Springer Verlag. https://doi.org/10.1007/978-1-4614-7010-6_39

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