基于自动机理论模型检测的一个关键算法是判断有穷状态系统是否满足属性的判空检测.对标准Büchi自动机作判空检测,容易引起状态爆炸.本文以TGBA为研究对象,提出基于启发式SCCs的广义Büchi自动机判空检测算法.该算法在on-the-fly算法的基础上结合启发式深度优先搜索和SCCs检测算法,能较快地判断TGBA的非空性.通过正确性证明、复杂性分析和实验验证了该算法的正确可行性.在TGBA非空的情况下,该算法的时空性能比已有算法更优.%The key operation of the automata-theoretic approach for model-checking is an emptiness checking algorithm, which can tell whether a finite state system satisfies its properties. It is usually done on standard Büchi automata with a single acceptance condition, whose state size is very large and the state space explosion is prone to happen. In this paper,a heuristic SCCs emptiness checking algorithm for generalized biichi automata is proposed, which is based on the on-the-fly algorithm, and can compute accepting runs of transition-based generalized Biichi automaton by heuristic depth first searching and detecting for strongly connected components. The correctness and feasibility of our method have been confirmed by theoretical proofs and experimental results.Compared with the traditional methods,while transition-based generalized Büchi automaton is not empty,the time and memory consumption are reduced in our method.
展开▼
