Skip to main content
SpringerLink
Log in

Bounded Rational Search for On-the-Fly Model Checking of LTL Properties

  • Conference paper
Fundamentals of Software Engineering (FSEN 2009)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5961))

Included in the following conference series:

Abstract

Model checking is considered as a promising approach for assuring the reliability of concurrent systems. Besides its strength it suffers from the state explosion problem, which reduces its applicability especially when systems grow larger. In this paper we propose a bounded rational verification approach for on-the-fly model checking of LTL properties. We optimize memory usage by increasing the probability of finding counter-examples. Since in on-the-fly model checking we do not have complete knowledge about the model, we use a machine learning method based on interaction and reward receiving. Based on the concept of fairness we propose a heuristic for defining rewards. We also exploit the ideas of probabilistic model checking in order to find a measure of correctness of the system in the case where no violations are found after generating a certain number of runs of the system. The experimental results show that this approach easily outperforms classic model checking approaches.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Araragi, T., Cho, S.M.: Checking liveness properties of concurrent systems by reinforcement learning. In: Edelkamp, S., Lomuscio, A. (eds.) MoChArt IV. LNCS (LNAI), vol. 4428, pp. 84–94. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Beauquier, D., Slissenko, A., Rabinovich, A.: A logic of probability with decidable model-checking. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 306–321. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Biere, A., Cimatti, A., Clarke, E.M., Zhu, Y.: Symbolic model checking without bdds. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol. 1579, pp. 193–207. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  4. Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Clarke, E.M., Emerson, E.A., Sistla, A.P.: Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems 8, 244–263 (1986)

    Article  MATH  Google Scholar 

  6. Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Form. Methods Syst. Des. 9(1-2), 77–104 (1996)

    Article  Google Scholar 

  7. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)

    Google Scholar 

  8. Clarke, E.M., Wing, J.M., et al.: Formal methods: State of the art and future directions. ACM Computing Surveys 28, 626–643 (1996)

    Article  Google Scholar 

  9. Dagum, P., Karp, R., Luby, M., Ross, S.: An optimal algorithm for monte carlo estimation. In: FOCS 1995, Washington, DC, USA, p. 142. IEEE Computer Society, Los Alamitos (1995)

    Google Scholar 

  10. Darbon, J., Lassaigne, R., Peyro, S.: Approximate probabilistic model checking for programs. In: Second IEEE International Conference on Intelligent Computer Communication and Processing, ICCP 2006 (2006)

    Google Scholar 

  11. Allen Emerson, E.: Temporal and modal logic, pp. 995–1072 (1990)

    Google Scholar 

  12. Allen Emerson, E., Prasad Sistla, A.: Symmetry and model checking. Form. Methods Syst. Des. 9(1-2), 105–131 (1996)

    Article  Google Scholar 

  13. Etessami, K., Kwiatkowska, M.Z., Vardi, M.Y., Yannakakis, M.: Multi-objective model checking of markov decision processes. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 50–65. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Godefroid, P.: Using partial orders to improve automatic verification methods. In: Clarke, E., Kurshan, R.P. (eds.) CAV 1990. LNCS, vol. 531, pp. 176–185. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  15. Grosu, R., Smolka, S.A.: Quantitative model checking. In: ISoLA (Preliminary proceedings). Technical Report, vol. TR-2004-6, pp. 165–174. Department of Computer Science, University of Cyprus (2004)

    Google Scholar 

  16. Grosu, R., Smolka, S.A.: Monte carlo model checking. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 271–286. Springer, Heidelberg (2005)

    Google Scholar 

  17. Haslum, P.: Model checking by random walk. In: ECSEL Workshop (1999)

    Google Scholar 

  18. Hérault, T., Lassaigne, R., Magniette, F., Peyronnet, S.: Approximate probabilistic model checking. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 73–84. Springer, Heidelberg (2004)

    Google Scholar 

  19. Jaghoori, M.M., Movaghar, A., Sirjani, M.: Modere: The model-checking engine of Rebeca. In: ACM Symposium on Applied Computing - Software Verificatin Track, pp. 1810–1815 (2006)

    Google Scholar 

  20. Kapp, R.M., Luby, M., Madras, N.: Monte-carlo approximation algorithms for enumeration problems. J. Algorithms 10(3), 429–448 (1989)

    Article  MathSciNet  Google Scholar 

  21. Kwiatkowska, M., Norman, G., Parker, D.: Stochastic model checking. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 220–270. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  22. McMillan, K.L.: Symbolic Model Checking. Kluwer Academic, Dordrecht (1993)

    MATH  Google Scholar 

  23. Pnueli, A.: The temporal semantics of concurrent programs, pp. 1–20 (1979)

    Google Scholar 

  24. Sirjani, M., Movaghar, A., Shali, A., de Boer, F.S.: Modeling and verification of reactive systems using Rebeca. Fundamenta Informaticae 63(4), 385–410 (2004)

    MathSciNet  Google Scholar 

  25. Prasad Sistla, A., Emerson, E.A.: On-the-fly model checking under fairness that exploits symmetry. In: Grumberg, O. (ed.) CAV 1997. LNCS, vol. 1254, pp. 232–243. Springer, Heidelberg (1997)

    Google Scholar 

  26. Sivaraj, H., Sivaraj, H., Gopalakrishnan, G., Gopalakrishnan, G.: Random walk based heuristic algorithms for distributed memory model checking. In: Proc. of Parallel and Distributed Model Checking (PDMC 2003). ENTCS, vol. 89, p. 2003. Elsevier, Amsterdam (2003)

    Google Scholar 

  27. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge

    Google Scholar 

  28. Tronci, E.: A probabilistic approach to automatic verification of concurrent systems. In: Proc. Asia-Pacific Software Engineering Conference (APSEC 2001), pp. 317–324. IEEE Computer Society, Los Alamitos (2001)

    Google Scholar 

  29. Valmari, A.: A stubborn attack on state explosion. Form. Methods Syst. Des. 1(4), 297–322 (1992)

    Article  MATH  Google Scholar 

  30. Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification. In: Proc. 1st Symp. on Logic in Computer Science, Cambridge, June 1986, pp. 332–344 (1986)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Electrical and Computer Engineering, University of Tehran, Tehran, Iran

    Razieh Behjati, Marjan Sirjani & Majid Nili Ahmadabadi

  2. School of Computer Science, Reykjavik University, Iceland

    Marjan Sirjani

  3. School of Computer Science, Institute for Research in Fundamental Sciences, Tehran, Iran

    Marjan Sirjani

  4. School of Cognitive Science, Institute for Research in Fundamental Sciences, Tehran, Iran

    Majid Nili Ahmadabadi

Authors
  1. Razieh Behjati
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marjan Sirjani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Majid Nili Ahmadabadi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Mathematics and Computer Science (CWI), Science Park 123, 1098 XG, Amsterdam, The Netherlands

    Farhad Arbab

  2. Reykjavik University, School of Computer Science, Kringlan 1, 103, Reykjavik, Iceland

    Marjan Sirjani

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Behjati, R., Sirjani, M., Nili Ahmadabadi, M. (2010). Bounded Rational Search for On-the-Fly Model Checking of LTL Properties. In: Arbab, F., Sirjani, M. (eds) Fundamentals of Software Engineering. FSEN 2009. Lecture Notes in Computer Science, vol 5961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11623-0_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11623-0_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11622-3

  • Online ISBN: 978-3-642-11623-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation