We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition graphs, as repeated sub-systems are described only once. Early work on model checking of hierarchical systems shows that one can do better than a naive algorithm that “flattens” the system and removes the hierarchy. Given a hierarchical system and a branching-time specification ψ for it, we reduce the model-checking problem (does satisfy ψ?) to the problem of solving a hierarchical game obtained by taking the product of with an alternating tree automaton for ψ. Our approach leads to clean, uniform, and improved model-checking algorithms for a variety of branching-time temporal logics. In particular, by improving the algorithm for solving hierarchical parity games, we are able to solve the model-checking problem for the μ-calculus in Pspace and time complexity that is only polynomial in the depth of the hierarchy. Our approach also leads to an abstraction-refinement paradigm for hierarchical systems. The abstraction maintains the hierarchy, and is obtained by merging both states and sub-systems into abstract states.
Improved Model Checking of Hierarchical Systems / B., Aminof; Murano, Aniello; O., Kupferman. - STAMPA. - 5944:(2010), pp. 61-77. (Intervento presentato al convegno 11th International Conference on Verification, Model Checking, and Abstract Interpretation, VMCAI 2010 tenutosi a Madrid, Spain nel 17-19 Gennaio, 2010,) [10.1007/978-3-642-11319-2_8].
Improved Model Checking of Hierarchical Systems
MURANO, ANIELLO;
2010
Abstract
We present a unified game-based approach for branching-time model checking of hierarchical systems. Such systems are exponentially more succinct than standard state-transition graphs, as repeated sub-systems are described only once. Early work on model checking of hierarchical systems shows that one can do better than a naive algorithm that “flattens” the system and removes the hierarchy. Given a hierarchical system and a branching-time specification ψ for it, we reduce the model-checking problem (does satisfy ψ?) to the problem of solving a hierarchical game obtained by taking the product of with an alternating tree automaton for ψ. Our approach leads to clean, uniform, and improved model-checking algorithms for a variety of branching-time temporal logics. In particular, by improving the algorithm for solving hierarchical parity games, we are able to solve the model-checking problem for the μ-calculus in Pspace and time complexity that is only polynomial in the depth of the hierarchy. Our approach also leads to an abstraction-refinement paradigm for hierarchical systems. The abstraction maintains the hierarchy, and is obtained by merging both states and sub-systems into abstract states.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.