@MISC{_distributedmemory, author = {}, title = {Distributed Memory LTL Model Checking}, year = {} }

Share

OpenURL

Abstract

Distribution and parallelization of model checking algorithms is receiving a growing interest as an additional technique to attack the state space explosion problem. In particular, networks of workstations are used to provide model checking algorithms with aggregate memory and computational power of several interconnected computers. Thus they allow distributed memory algorithms to verify larger (hence more realistic) systems. The thesis focuses on the automata-based approach to the LTL model checking problem. This approach reduces the problem of LTL model checking to the problem of non-emptiness of a Büchi automaton which can be further reduced to the problem of the existence of an accepting cycle in the corresponding automaton graph. Unfortunately, the standard Nested DFS algorithm, which is used to solve the problem in the sequential case, is hardly parallelized because it builds on the depth first search postorder whose computation is an inherently sequential problem. There are three completely new algorithms suggested in this thesis to solve the accepting cycle detection problem in a distributed memory environment. The first one employs the verified LTL formula to achieve such a distribution of the graph that it suffices to perform