Partial order reductions have been successfully applied to model checking of concurrent systems and practical applications of the technique show nontrivial reduction in the size of the explored state space. We present a theory of partial order reduction based on stubborn sets in the game-theoretical setting of 2-player games with reachability objectives. Our stubborn reduction allows us to prune the interleaving behaviour of both players in the game, and we formally prove its correctness on the class of games played on general labelled transition systems. We then instantiate the framework to the class of weighted Petri net games with inhibitor arcs and provide its efficient implementation in the model checker TAPAAL. Finally, we evaluate our stubborn reduction on several case studies and demonstrate its efficiency.
翻译:部分降级已被成功应用到对同时系统进行示范性检查以及技术显示的实用应用中,在所探索国家空间的大小中,技术显示没有两端缩小。我们提出了一个部分降级理论,其依据是具有可达性目标的2人游戏游戏游戏的游戏理论设置中的固态组合。我们顽固的降级让我们得以减少游戏中两个玩家的相互交织行为,我们正式证明它在通用的过渡系统中所玩的游戏类别上的正确性。然后,我们将框架转至带有抑制电弧的加权Petri网游戏类别,并在模拟检查台TAPAAL中有效地实施这一框架。最后,我们评估了我们对几个案例研究的顽固降级,并展示了其效率。