Advertisement

Improved Model Checking of Hierarchical Systems

  • Benjamin Aminof
  • Orna Kupferman
  • Aniello Murano
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5944)

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 \(\mathcal S\) and a branching-time specification ψ for it, we reduce the model-checking problem (does \(\mathcal S\) satisfy ψ?) to the problem of solving a hierarchical game obtained by taking the product of \(\mathcal S\) with an alternating tree automaton \({\mathcal A}_\psi\) 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.

Keywords

Model Check Hierarchical System Winning Strategy Exit Node Summary Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alur, R., Benedikt, M., Etessami, K., Godefroid, P., Reps, T.W., Yannakakis, M.: Analysis of recursive state machines. ACM TOPLAS 27(4), 786–818 (2005)CrossRefGoogle Scholar
  2. 2.
    Alur, R., Chaudhuri, S., Etessami, K., Madhusudan, P.: On-the-fly reachability and cycle detection for recursive state machines. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 61–76. Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 207–220. Springer, Heidelberg (2001)Google Scholar
  4. 4.
    Alur, R., Kannan, S., Yannakakis, M.: Communicating hierarchical state machines. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 169–178. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  5. 5.
    Alur, R., Yannakakis, M.: Model checking of hierarchical state machines. ACM Trans. Program. Lang. Syst. 23(3), 273–303 (2001)CrossRefGoogle Scholar
  6. 6.
    Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)Google Scholar
  7. 7.
    Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Trans. Program. Lang. Syst. 19(2), 253–291 (1997)CrossRefGoogle Scholar
  8. 8.
    de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.): COMPOS 1997. LNCS, vol. 1536. Springer, Heidelberg (1998)Google Scholar
  9. 9.
    Drusinsky, D., Harel, D.: On the power of bounded concurrency I: Finite automata. J. of the ACM 41(3), 517–539 (1994)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Emerson, E.A., Jutla, C.: Tree automata, μ-calculus and determinacy. In: FOCS 1991, pp. 368–377 (1991)Google Scholar
  11. 11.
    Godefroid, P., Jagadeesan, R.: Automatic abstraction using generalized model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 137–150. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  12. 12.
    Göller, S., Lohrey, M.: Fixpoint logics on hierarchical structures. In: Sarukkai, S., Sen, S. (eds.) FSTTCS 2005. LNCS, vol. 3821, pp. 483–494. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  13. 13.
    Harel, D., Kupferman, O., Vardi, M.Y.: On the complexity of verifying concurrent transition systems. J. of Inf. & Comp. 173, 1–19 (2002)CrossRefMathSciNetGoogle Scholar
  14. 14.
    Huth, M., Jagadeesan, R., Schmidt, D.A.: Modal transition systems: A foundation for three-valued program analysis. In: Sands, D. (ed.) ESOP 2001. LNCS, vol. 2028, pp. 155–169. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  15. 15.
    Kupferman, O., Vardi, M.Y., Wolper, P.: An automata-theoretic approach to branching-time model checking. J. of the ACM 47(2), 312–360 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    La Torre, S., Napoli, M., Parente, M., Parlato, G.: Verification of scope-dependent hierarchical state machines. Inf. Comput. 206(9-10), 1161–1177 (2008)zbMATHCrossRefGoogle Scholar
  17. 17.
    Larsen, K.G., Thomsen, B.: A modal process logic. In: LICS, pp. 203–210. IEEE Computer Society, Los Alamitos (1988)Google Scholar
  18. 18.
    Murano, A., Napoli, M., Parente, M.: Program complexity in hierarchical module checking. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 318–332. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  19. 19.
    Pnueli, A.: In transition from global to modular temporal reasoning about programs. In: Apt, K. (ed.) Logics and Models of Concurrent Systems. NATO Advanced Summer Institutes, vol. F-13, pp. 123–144. Springer, Heidelberg (1985)Google Scholar
  20. 20.
    Qadeer, S.: Taming concurrency: A program verification perspective. In: van Breugel, F., Chechik, M. (eds.) CONCUR 2008. LNCS, vol. 5201, p. 5. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  21. 21.
    Rabinovich, A.: Complexity of equivalence problems for concurrent systems of finite agents. J. of Inf. & Comp. 139(2), 111–129 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  22. 22.
    Shoham, S., Grumberg, O.: A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 275–287. Springer, Heidelberg (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Benjamin Aminof
    • 1
  • Orna Kupferman
    • 1
  • Aniello Murano
    • 2
  1. 1.Hebrew UniversityJerusalemIsrael
  2. 2.Università degli Studi di Napoli “Federico II”NapoliItaly

Personalised recommendations