Automatic Compositional Verification of Timed Systems

  • Shang-Wei Lin
  • Yang Liu
  • Jun Sun
  • Jin Song Dong
  • Étienne André
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7436)


Specification and verification of real-time systems are important research topics with crucial applications; however, the so-called state space explosion problem often prevents model checking to be used in practice for large systems. In this work, we present a self-contained toolkit to analyze real-time systems specified using event-recording automata (ERAs), which supports system modeling, animated simulation, and fully automatic compositional verification based on learning techniques. Experimental results show that our tool outperforms the state-of-the-art timed model checker.


Model Check Proof Rule Monolithic Approach State Space Explosion Problem UPPAAL Model 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Alur, R., Fix, L., Henzinger, T.A.: Event-clock automata: A determinizable class of timed automata. Theoretical Computer Science 211(1-2), 253–273 (1999)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)MathSciNetMATHCrossRefGoogle Scholar
  3. 3.
    Clarke, E.M., Long, D.E., MacMillan, K.L.: Compositional model checking. In: LICS, pp. 353–362 (1989)Google Scholar
  4. 4.
    Cobleigh, J.M., Giannakopoulou, D., Păsăreanu, C.S.: Learning Assumptions for Compositional Verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol. 2619, pp. 331–346. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  5. 5.
    Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. Theorectical Computer Science 411(47), 4029–4054 (2010)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
  7. 7.
  8. 8.
    Lin, S.-W., André, É., Dong, J.S., Sun, J., Liu, Y.: An Efficient Algorithm for Learning Event-Recording Automata. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 463–472. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  9. 9.
    Namjoshi, K.S., Trefler, R.J.: On the Completeness of Compositional Reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 139–153. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  10. 10.
    Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: Towards Flexible Verification under Fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709–714. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  11. 11.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shang-Wei Lin
    • 1
  • Yang Liu
    • 1
  • Jun Sun
    • 2
  • Jin Song Dong
    • 3
  • Étienne André
    • 4
  1. 1.Temasek LaboratoriesNational University of SingaporeSingapore
  2. 2.Singapore University of Technology and DesignSingapore
  3. 3.National University of SingaporeSingapore
  4. 4.LIPN, CNRS UMR 7030Université Paris 13France

Personalised recommendations