Skip to main content

Checking Liveness Properties of Concurrent Systems by Reinforcement Learning

  • Conference paper
Model Checking and Artificial Intelligence (MoChArt 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4428))

Included in the following conference series:

Abstract

In this paper, we propose a new method of testing concurrent systems by using an artificial intelligence technique: reinforcement learning. In particular, the method verifies the liveness properties given in temporal logic formulas and dynamically controls a target system in runtime monitoring to efficiently reveal possible error against specification. In this control, the learning method accumulates necessary information by monitoring the running system. We built a simulator to evaluate this idea and conducted experiments with simple examples. As a result we showed the effectiveness of this approach for solving the difficult problem of testing the liveness properties of concurrent systems.

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

Access this chapter

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. Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge, MA (2000)

    Google Scholar 

  2. Dwyer, M.B., Avrunin, G.S., Corbett, J.C.: Patterns in Property Specification for Finite-state Verification. In: The 21st ICSE, pp. 411–420 (1999)

    Google Scholar 

  3. Harel, D.: On Visual Formalism. Comm. of ACM, pp. 514–530 (1988)

    Google Scholar 

  4. Havelund, K., Rosu, G.: Testing Linear Temporal Logic Formulae on Finite Execution Traces. RIACS Technical Report TR 01-08 (2001)

    Google Scholar 

  5. Holzmann, G.: Software Analysis and Model Checking. In: Proc. Computer Aided Verification, pp. 1–16 (2002)

    Google Scholar 

  6. Kim, M., Kannan, S., Lee, I., Sokolsky, O., Viswanathan, M.: Java-MaC: a Run-time Assurance Tool for Java Programs. In: Proc. First Workshop on Runtime Verification (RV 2001), July 2001 (2001)

    Google Scholar 

  7. Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  8. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems - Specification. Springer, Heidelberg (1992)

    Google Scholar 

  9. Sutton, R.S., Barto, A.G.: Reinforcement Learning: An introduction. MIT Press, Cambridge, MA (1998)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Stefan Edelkamp Alessio Lomuscio

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Araragi, T., Cho, S.M. (2007). Checking Liveness Properties of Concurrent Systems by Reinforcement Learning. In: Edelkamp, S., Lomuscio, A. (eds) Model Checking and Artificial Intelligence. MoChArt 2006. Lecture Notes in Computer Science(), vol 4428. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74128-2_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74128-2_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74127-5

  • Online ISBN: 978-3-540-74128-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics