Work

Distributed CTL Model–Checking and counterexample search

Year: 2009
Type: conference-paper
Abstract: 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.
Language: English
Open Access status: hybrid
OpenAlex ID: W22348942
FWCI: 0.47
Cites: 28
Cited by: 6
Related to: 10