Skip to main content
Springer Nature Link
Log in

Learning Meets Verification

  • Conference paper
Formal Methods for Components and Objects (FMCO 2006)

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

Included in the following conference series:

  • 610 Accesses

Abstract

In this paper, we give an overview on some algorithms for learning automata. Starting with Biermann’s and Angluin’s algorithms, we describe some of the extensions catering for specialized or richer classes of automata. Furthermore, we survey their recent application to verification problems.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J.: Algorithmic improvements in regular model checking. In: Hunt, Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 236–248. Springer, Heidelberg (2003)

    Google Scholar 

  2. Abdulla, P.A., Jonsson, B., Nilsson, M., Saksena, M.: A survey of regular model checking. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 35–48. Springer, Heidelberg (2004)

    Google Scholar 

  3. Alur, R., Cerný, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: Palsberg, J., Abadi, M. (eds.) POPL, pp. 98–109. ACM Press, New York (2005)

    Chapter  Google Scholar 

  4. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur, R., Madhusudan, P., Nam, W.: Symbolic compositional verification by learning assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 548–562. Springer, Heidelberg (2005)

    Google Scholar 

  6. Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)

    Article  MATH  MathSciNet  Google Scholar 

  7. Apt, K.R., Kozen, D.: Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett. 22(6), 307–309 (1986)

    Article  MathSciNet  Google Scholar 

  8. Balcázar, J.L., Díaz, J., Gavaldá, R.: Algorithms for learning finite automata from queries: A unified view. In: Advances in Algorithms, Languages, and Complexity, pp. 53–72. Kluwer, Dordrecht (1997)

    Google Scholar 

  9. Baresi, L., Heckel, R. (eds.): FASE 2006 and ETAPS 2006. LNCS, vol. 3922, pp. 27–28. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  10. Berg, T., Grinchtein, O., Jonsson, B., Leucker, M., Raffelt, H., Steffen, B.: On the correspondence between conformance testing and regular inference. In: Cerioli, M. (ed.) FASE 2005. LNCS, vol. 3442, pp. 175–189. Springer, Heidelberg (2005)

    Google Scholar 

  11. Berg, T., Jonsson, B., Leucker, M., Saksena, M.: Insights to Angluin’s learning. In: Proceedings of the International Workshop on Software Verification and Validation (SVV 2003). Electronic Notes in Theoretical Computer Science, vol. 118, pp. 3–18 (December 2003)

    Google Scholar 

  12. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi and Heckel [9], pp. 107–121

    Google Scholar 

  13. Berg, T., Raffelt, H.: Model checking. In: Broy et al. [16]

    Google Scholar 

  14. Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behaviour. IEEE Transactions on Computers 21, 592–597 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bollig, B., Katoen, J.-P., Kern, C., Leucker, M.: Replaying play in and play out: Synthesis of design models from scenarios by learning. In: Grumberg, O., Huth, M. (eds.) ETAPS 2007 and TACAS 2007. LNCS, vol. 4424, Springer, Heidelberg (2007)

    Google Scholar 

  16. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-Based Testing of Reactive Systems. LNCS, vol. 3472. Springer, Heidelberg (2005)

    MATH  Google Scholar 

  17. Bryant, R.E.: Symbolic manipulation of boolean functions using a graphical representation. In: Proceedings of the 22nd ACM/IEEE Design Automation Conference, pp. 688–694. IEEE Computer Society Press, Los Alamitos, CA (1985)

    Google Scholar 

  18. Chaki, S., Clarke, E.M., Sinha, N., Thati, P.: Automated assume-guarrantee reasoning for simulation conformance. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 534–547. Springer, Heidelberg (2005)

    Google Scholar 

  19. Chow, T.S.: Testing software design modeled by finite-state machines. IEEE Trans. on Software Engineering 4(3), 178–187 (1978) (Special collection based on COMPSAC)

    Article  Google Scholar 

  20. Cimatti, A., Clarke, E., Giunchiglia, E., Giunchiglia, F., Pistore, M., Roveri, M., Sebastiani, R., Tacchella, A.: NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  21. Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. The MIT Press, Cambridge, Massachusetts (1999)

    Google Scholar 

  22. Clarke, E.M., Talupur, M., Touili, T., Veith, H.: Verification by network decomposition. In: Gardner, P., Yoshida, N. (eds.) CONCUR 2004. LNCS, vol. 3170, pp. 276–291. Springer, Heidelberg (2004)

    Google Scholar 

  23. Clarke, E.M., Talupur, M., Veith, H.: Environment abstraction for parameterized verification. In: Emerson, E.A., Namjoshi, K.S. (eds.) VMCAI 2006. LNCS, vol. 3855, pp. 126–141. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  24. Cobleigh, J.M., Giannakopoulou, D., Pasareanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol. 2619, pp. 331–346. Springer, Heidelberg (2003)

    Google Scholar 

  25. Dimovski, A., Lazic, R.: Assume-guarantee software verification based on game semantics. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 529–548. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  26. Drewes, F., Högberg, J.: Learning a regular tree language from a teacher. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 279–291. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  27. D’Souza, D.: A logical characterisation of event clock automata. International Journal of Foundations of Computer Science (IJFCS) 14(4), 625–639 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  28. Emerson, E., Kahlon, V.: Reducing model checking of the many to the few. In: McAllester, D. (ed.) CADE 2000. LNCS, vol. 1831, pp. 236–254. Springer, Heidelberg (2000)

    Google Scholar 

  29. Emerson, E., Namjoshi, K.: Reasoning about rings. In: Proc. 22th ACM Symp. on Principles of Programming Languages (1995)

    Google Scholar 

  30. Gold, E.M.: Language identification in the limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  31. Gold, E.M.: Complexity of automaton identification from given data. Information and Control 37(3), 302–320 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  32. Grinchtein, O., Jonsson, B., Leucker, M.: Inference of timed transition systems. In: 6th International Workshop on Verification of Infinite-State Systems. Electronic Notes in Theoretical Computer Science, vol. 138/4, Elsevier Science Publishers, Amsterdam (2004)

    Google Scholar 

  33. Grinchtein, O., Jonsson, B., Leucker, M.: Learning of event-recording automata. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, Springer, Heidelberg (2004)

    Google Scholar 

  34. Grinchtein, O., Jonsson, B., Pettersson, P.: Inference of event-recording automata using timed decision trees. In: Baier, C., Hermanns, H. (eds.) CONCUR 2006. LNCS, vol. 4137, pp. 435–449. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  35. Grinchtein, O., Leucker, M., Piterman, N.: Inferring network invariants automatically. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  36. Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. In: Katoen, J.-P., Stevens, P. (eds.) ETAPS 2002 and TACAS 2002. LNCS, vol. 2280, p. 357. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  37. Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. Electr. Notes Theor. Comput. Sci. 138(3), 21–36 (2005)

    Article  MathSciNet  Google Scholar 

  38. Hungar, H., Niese, O., Steffen, B.: Domain-specific optimization in automata learning. In: Proc. 15th Int. Conf. on Computer Aided Verification (2003)

    Google Scholar 

  39. Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Schwartzbach, M.I., Graf, S. (eds.) ETAPS 2000 and TACAS 2000. LNCS, vol. 1785, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  40. Kesten, Y., Piterman, N., Pnueli, A.: Bridging the gap between fair simulation and trace inclusion. Information and Computation 200(1), 35–61 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  41. Kesten, Y., Pnueli, A.: Control and data abstraction: The cornerstones of practical formal verification. Software Tools for Technology Transfer 2(4), 328–342 (2000)

    Article  MATH  Google Scholar 

  42. Kesten, Y., Pnueli, A., Shahar, E., Zuck, L.: Network invariants in action. In: Brim, L., Jančar, P., Křetínský, M., Kucera, A. (eds.) CONCUR 2002. LNCS, vol. 2421, Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  43. Kurshan, R.P., McMillan, K.L.: A structural induction theorem for processes. Information and Computation 117(1), 1–11 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  44. Lang, K.J.: Random dfa’s can be approximately learned from sparse uniform examples. In: COLT, pp. 45–52 (1992)

    Google Scholar 

  45. Maler, O., Pnueli, A.: On the learnability of infinitary regular sets, Esprit Basic Reasearch Action No 3096 (1991)

    Google Scholar 

  46. Namjoshi, K.S., Trefler, R.J.: On the competeness of compositional reasoning. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 139–153. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  47. Oliveira, A.L., Silva, J.P.M.: Efficient algorithms for the inference of minimum size dfas. Machine Learning 44(1/2), 93–119 (2001)

    Article  MATH  Google Scholar 

  48. Oncina, J., Garcia, P.: Inferring regular languages in polynomial update time. In: de la Blanca, N.P., Sanfeliu, A., Vidal, E. (eds.) Pattern Recognition and Image Analysis. Series in Machine Perception and Artificial Intelligence, vol. 1, pp. 49–61. World Scientific, Singapore (1992)

    Google Scholar 

  49. Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: Wu, J., Chanson, S.T., Gao, Q. (eds.) Formal Methods for Protocol Engineering and Distributed Systems, FORTE/PSTV, pp. 225–240. Kluwer, Beijing, China (1999)

    Google Scholar 

  50. Pena, J.M., Oliveira, A.L.: A new algorithm for the reduction of incompletely specified finite state machines. In: ICCAD, pp. 482–489 (1998)

    Google Scholar 

  51. Pnueli, A., Shahar, E.: Liveness and acceleration in parameterized verification. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 328–343. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  52. Raffelt, H., Steffen, B.: Learnlib: A library for automata learning and experimentation. In: Baresi and Heckel [9], pp. 377–380

    Google Scholar 

  53. Thomas, W.: Automata on infinite objects. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 4, vol. B, pp. 133–191. Elsevier Science Publishers B. V, Amsterdam (1990)

    Google Scholar 

  54. Trakhtenbrot, B., Barzdin, J.: Finite automata: behaviour and synthesis. North-Holland, Amsterdam (1973)

    Google Scholar 

  55. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Actively learning to verify safety for fifo automata. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 494–505. Springer, Heidelberg (2004)

    Google Scholar 

  56. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Learning to verify safety properties. In: Davies, J., Schulte, W., Barnett, M. (eds.) ICFEM 2004. LNCS, vol. 3308, pp. 274–289. Springer, Heidelberg (2004)

    Google Scholar 

  57. Vardhan, A., Sen, K., Viswanathan, M., Agha, G.: Using language inference to verify omega-regular properties. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol. 3440, pp. 45–60. Springer, Heidelberg (2005)

    Google Scholar 

  58. Vardhan, A., Viswanathan, M.: Learning to verify branching time properties. In: Redmiles, D.F., Ellman, T., Zisman, A. (eds.) ASE, pp. 325–328. ACM, New York (2005)

    Chapter  Google Scholar 

  59. Vasilevski, M.P.: Failure diagnosis of automata. Cybernetic 9(4), 653–665 (1973)

    Article  Google Scholar 

  60. Wolper, P., Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In: Sifakis, J. (ed.) Automatic Verification Methods for Finite State Systems. LNCS, vol. 407, pp. 68–80. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, TU München, Germany

    Martin Leucker

Authors
  1. Martin Leucker
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Frank S. de Boer Marcello M. Bonsangue Susanne Graf Willem-Paul de Roever

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leucker, M. (2007). Learning Meets Verification. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, WP. (eds) Formal Methods for Components and Objects. FMCO 2006. Lecture Notes in Computer Science, vol 4709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74792-5_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-74792-5_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-74791-8

  • Online ISBN: 978-3-540-74792-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics