In this paper, we propose a distributed algorithm for CTL model-checking and a counterexample search whenever the CTL formula is not satisfied. The distributed approach is used in order to cope with the state space explosion problem. A cluster of workstations performs collaborative verification over a partitioned state space. Thus, every process involved in the distributed verification executes a labelling procedure on its own partial state space, and uses the parse tree of the CTL formula to evaluate sub-formulas and delay the synchronisations so as to minimise idle time. A counterexample search consists in a distributed construction of the tree-like corresponding to the failure executions. Some experiments have been carried out to evaluate the efficiency of this approach.
Content
Author and article information
Contributors
M.C. Boukala
L. Petrucci
Conference
Publication date:
July
2009
Publication date
(Print):
July
2009
Pages: 1-12
Affiliations
[0001]LSI, Computer Science department, USTHB
BP 32 El-Alia
Algiers, ALGERIA
[0002]LIPN, CNRS UMR 7030, Université Paris XIII
99, avenue Jean-Baptiste Clément
F-93430 Villetaneuse, FRANCE