Transactions of the Japanese Society for Artificial Intelligence
Short Paper
Speedup of OWCTY Model Checking Algorithm Using Strongly Connected Components
Toshiki KAWABATAFumiyoshi KOBAYASHIKazunori UEDA
Author information
JOURNALS FREE ACCESS

Volume 26 (2011) Issue 2 Pages 341-346

Details
Download PDF (335K) Contact us
Abstract

Model checking is an exhaustive search method of verification. Automata-based LTL model checking is one of the methods to solve accepting cycle search problems. Model checking is prone to state-space explosion, and we may expect that parallel processing would be a promising approach. However, the optimal sequential algorithm is based on post-order depth-first seach and is difficult to parallelize. Alternative parallel algorithms have been proposed, and OWCTY_reversed is one of them. OWCTY_reversed is known to be a stable and fast algorithm for models that accept some words, but it does not use the characteristics of the automata used in LTL model checking. We propose a new algorithm named SCC-OWCTY that exploits the SCCs (strongly connected components) of property automata. The algorithm removes states that are judged not to form accepting cycles faster than OWCTY_reversed. We experimented and compared the two algorithms using DiVinE, and confirmed improvements both in performance and scalability.

Information related to the author
© 2011 JSAI (The Japanese Society for Artificial Intelligence)
Previous article Next article

Recently visited articles
feedback
Top