How to distribute LTL model-checking using decomposition of negative claim automaton

• Authors: BARNAT Jiří
• Year of publication: 2002
• Type: Article in Proceedings
• Conference: SOFSEM 2002 Student Research Forum Proceedings
• MU Faculty or unit: Faculty of Informatics
• Field: Informatics
• Keywords: Distribute LTL model-checking; Negative Claim Automaton
• Description: We propose a distributed algorithm for model-checking LTL formulas that works on a network of workstations and effectively uses the decomposition of the formula automaton to strongly connected components to achieve more efficient distribution of the verification problem. In particular, we explore the possibility of performing a distributed nested depth-first search algorithm.

Related projects

• Algorithms and tools for practical verification of concurrent systems.
• Non-sequential Models of Computing -- Quantum and Concurrent Distributed Models of Computing