Parallel Multiple Counter-Examples Guided Abstraction Loop — Applying to Timed Automaton—
Parallel Multiple Counter-Examples Guided Abstraction Loop — Applying to Timed Automaton—
复制标题
DOI:
--
复制
发表时间:
2016
期刊:
影响因子:
--
通讯作者:
Kozo Okano;Takeshi Nagaoka;Toshiaki Tanaka;Toshifusa Sekizawa;S. Kusumoto
中科院分区:
文献类型:
--
作者:
Kozo Okano;Takeshi Nagaoka;Toshiaki Tanaka;Toshifusa Sekizawa;S. Kusumoto
A model checking technique proves that a given system satisfies given specifications by searching exhaustively a finite transition system which represents the system’s whole behavior. If the system becomes large, it is impossible to explore the whole states in reasonable time due to both of CPU time used and memory space where the model is stored. This is called the state explosion problem. One of the solutions to avoid the state explosion problem is using a model abstraction technique. In usual, constructing such an abstract model from the original model becomes error-prone. Hence, automatic generation techniques of abstract models are studied. Especially, Counter-Example Guided Abstraction Refinement (CEGAR) is considered as a promising technique because it automatically refines abstract model if the result is spurious, starting from a small abstract model. We have already proposed a concrete CEGAR loop for a timed automaton. This iteration loop refines the model in fine granularity level. It avoids the state explosion, however, the number of loops increases. This paper proposes a revised technique where multiple counter-examples are simultaneously applied in the refinement step of CEGAR. This device reduces the number of iteration loops. Experimental results show the improvement.