Skip to main content
SpringerLink
Log in

Model Checking, Synthesis, and Learning

  • Chapter
  • First Online:
Model Checking, Synthesis, and Learning

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 13030))

  • 482 Accesses

Abstract

Reliability is a central concern of software system development. It can be approached in three ways, in a post-mortem fashion via verification of an unknown artefact, by construction applying correctness preserving steps, and via testing of the final product. In this paper, we introduce the nine contributions to the Festschrift dedicated to Bengt Jonsson on the occasion of his 60th birthday. Verification is addressed here from the model checking perspective, correctness by construction via synthesis, and testing as both a means and a as by-product of active automata learning while reflecting on the impact Bengt had on these developments.

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.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

References

  1. Abdulla, J., Yi, W.: Cause-effect reaction latency in real-time systems. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 41–56. Springer, Cham (2021)

    Google Scholar 

  2. Abdulla, P.A., Bouajjani, A., Jonsson, B., Nilsson, M.: Handling global conditions in parametrized system verification. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 134–145. Springer, Heidelberg (1999). https://doi.org/10.1007/3-540-48683-6_14

    Chapter  MATH  Google Scholar 

  3. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science, New Brunswick, New Jersey, USA, 27–30 July 1996, pp. 313–321. IEEE Computer Society (1996). https://doi.org/10.1109/LICS.1996.561359

  4. Abdulla, P.A., Jonsson, B., Mahata, P., d’Orso, J.: Regular tree model checking. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 555–568. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45657-0_47

    Chapter  Google Scholar 

  5. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J.: Regular model checking made simple and effcient\(^*\). In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 116–131. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45694-5_9

    Chapter  Google Scholar 

  6. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J.: Algorithmic improvements in regular model checking. In: Hunt, W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 236–248. Springer, Heidelberg (2003). https://doi.org/10.1007/978-3-540-45069-6_25

    Chapter  Google Scholar 

  7. 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). https://doi.org/10.1007/978-3-540-28644-8_3

    Chapter  Google Scholar 

  8. Margaria, T., Schieweck, A.: Towards engineering digital twins by active behaviour mining. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 138–163. Springer, Cham (2021)

    Google Scholar 

  9. Bacci, G., Delahaye, B., Larsen, K., Mariegaardwhich, A.: Quantitative analysis of interval Markov chains. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 57–77. Springer, Cham (2021)

    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). https://doi.org/10.1007/978-3-540-31984-9_14

    Chapter  Google Scholar 

  11. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines with parameters. In: Baresi, L., Heckel, R. (eds.) FASE 2006. LNCS, vol. 3922, pp. 107–121. Springer, Heidelberg (2006). https://doi.org/10.1007/11693017_10

    Chapter  Google Scholar 

  12. Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) FASE 2008. LNCS, vol. 4961, pp. 317–331. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-78743-3_24

    Chapter  Google Scholar 

  13. Bertolino, A., Calabrò, A., Merten, M., Steffen, B.: Never-stop learning: continuous validation of learned models for evolving systems through monitoring. ERCIM News 2012(88) (2012)

    Google Scholar 

  14. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 403–418. Springer, Heidelberg (2000). https://doi.org/10.1007/10722167_31

    Chapter  Google Scholar 

  15. Cassel, S., Howar, F., Jonsson, B., Merten, M., Steffen, B.: A succinct canonical register automaton model. In: Bultan, T., Hsiung, P.-A. (eds.) ATVA 2011. LNCS, vol. 6996, pp. 366–380. Springer, Heidelberg (2011). https://doi.org/10.1007/978-3-642-24372-1_26

    Chapter  Google Scholar 

  16. Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: Giannakopoulou, D., Salaün, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 250–264. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-10431-7_18

    Chapter  Google Scholar 

  17. Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Active learning for extended finite state machines. Formal Aspects Comput. 28(2), 233–263 (2016). https://doi.org/10.1007/s00165-016-0355-5

    Article  MathSciNet  MATH  Google Scholar 

  18. Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Extending automata learning to extended finite state machines. In: Bennaceur, A., Hähnle, R., Meinke, K. (eds.) Machine Learning for Dynamic Software Analysis: Potentials and Limits. LNCS, vol. 11026, pp. 149–177. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-96562-8_6

    Chapter  Google Scholar 

  19. Cassel, S., Jonsson, B., Howar, F., Steffen, B.: A succinct canonical register automaton model for data domains with binary relations. In: Chakraborty, S., Mukund, M. (eds.) ATVA 2012. LNCS, pp. 57–71. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33386-6_6

    Chapter  MATH  Google Scholar 

  20. Frohme, M., Steffen, B.: Never-stop context-free learning. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 164–185. Springer, Cham (2021)

    Google Scholar 

  21. Gieseking, M., Olderog, E.R.: High-level representation of benchmark families for petri games. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 115–137. Springer, Cham (2021)

    Google Scholar 

  22. Hansson, H., Jonsson, B.: A framework for reasoning about time and reliability. In: Proceedings of the Real-Time Systems Symposium, Santa Monica, California, USA, December 1989, pp. 102–111. IEEE Computer Society (1989). https://doi.org/10.1109/REAL.1989.63561

  23. Hansson, H., Jonsson, B.: A logic for reasoning about time and reliability. Formal Aspects Comput. 6(5), 512–535 (1994). https://doi.org/10.1007/BF01211866

    Article  MATH  Google Scholar 

  24. Howar, F., Dierl, S.: A taxonomy and reductions for common register automata formalisms. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 186–218. Springer, Cham (2021)

    Google Scholar 

  25. Howar, F., Jonsson, B., Merten, M., Steffen, B., Cassel, S.: On handling data in automata learning. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 221–235. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-16561-0_24

    Chapter  Google Scholar 

  26. Howar, F., Jonsson, B., Vaandrager, F.: Combining black-box and white-box techniques for learning register automata. In: Steffen, B., Woeginger, G. (eds.) Computing and Software Science. LNCS, vol. 10000, pp. 563–588. Springer, Cham (2019). https://doi.org/10.1007/978-3-319-91908-9_26

    Chapter  Google Scholar 

  27. Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251–266. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-27940-9_17

    Chapter  Google Scholar 

  28. Jonsson, B.: A model and proof system for asynchronous networks. In: Malcolm, M.A., Strong, H.R. (eds.) Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, 5–7 August 1985, pp. 49–58. ACM (1985). https://doi.org/10.1145/323596.323601

  29. Jonsson, B.: Modular verification of asynchronous networks. In: Schneider, F.B. (ed.) Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, 10–12 August 1987, pp. 152–166. ACM (1987). https://doi.org/10.1145/41840.41853

  30. Jonsson, B., Larsen, K.G.: Specification and refinement of probabilistic processes. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science (LICS ’91), Amsterdam, The Netherlands, 15–18 July 1991, pp. 266–277. IEEE Computer Society (1991). https://doi.org/10.1109/LICS.1991.151651

  31. Jonsson, B., Margaria, T., Naeser, G., Nyström, J., Steffen, B.: Incremental requirement specification for evolving systems. In: Calder, M., Magill, E.H. (eds.) Feature Interactions in Telecommunications and Software Systems VI, Glasgow, Scotland, UK, 17–19 May 2000, pp. 145–162. IOS Press (2000)

    Google Scholar 

  32. Jonsson, B., Margaria, T., Naeser, G., Nyström, J., Steffen, B.: Incremental requirement specification for evolving systems. Nord. J. Comput. 8(1), 65–87 (2001)

    MATH  Google Scholar 

  33. Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 220–235. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-46419-0_16

    Chapter  MATH  Google Scholar 

  34. Jonsson, B., Tsay, Y.: Assumption/guarantee specifications in linear-time temporal logic. Theor. Comput. Sci. 167(1 & 2), 47–72 (1996). https://doi.org/10.1016/0304-3975(96)00069-2

    Article  MathSciNet  MATH  Google Scholar 

  35. Lin, A., Rümmer, P.: Regular model checking revisited. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 97–114. Springer, Cham (2021)

    Google Scholar 

  36. Tsay, Y., Vardi, M.: From linear temporal logics to büchi automata: the early and simple principle. In: Olderog, E.-R., et al. (eds.) Jonsson Festschrift. LNCS, vol. 13030, pp. 8–40. Springer, Cham (2021)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Oldenburg, Oldenburg, Germany

    Ernst-Rüdiger Olderog

  2. Chair for Programming Systems, TU Dortmund University, Dortmund, Germany

    Bernhard Steffen

  3. Department of Information Technology, Uppsala University, Uppsala, Sweden

    Wang Yi

Authors
  1. Ernst-Rüdiger Olderog
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bernhard Steffen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wang Yi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Bernhard Steffen .

Editor information

Editors and Affiliations

  1. Universität Oldenburg, Oldenburg, Germany

    Ernst-Rüdiger Olderog

  2. TU Dortmund University, Dortmund, Germany

    Bernhard Steffen

  3. Uppsala University, Uppsala, Sweden

    Wang Yi

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Olderog, ER., Steffen, B., Yi, W. (2021). Model Checking, Synthesis, and Learning. In: Olderog, ER., Steffen, B., Yi, W. (eds) Model Checking, Synthesis, and Learning. Lecture Notes in Computer Science(), vol 13030. Springer, Cham. https://doi.org/10.1007/978-3-030-91384-7_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-91384-7_1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-91383-0

  • Online ISBN: 978-3-030-91384-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation