Skip to main content
SpringerLink
Log in

Extrapolating (omega-)regular model checking

  • RMC Regular Model Checking
  • Published:
International Journal on Software Tools for Technology Transfer Aims and scope Submit manuscript

Abstract

(Omega-)Regular model checking is the name of a family of techniques in which states are represented by words, sets of states by finite automata on these objects, and transitions by finite automata operating on pairs of state encodings, i.e., finite-state transducers. In this context, the problem of computing the set of reachable states of a system can be reduced to the one of computing the iterative closure of the finite-state transducer representing its transition relation. In this tutorial article, we survey an extrapolation-based technique for computing the closure of a given transducer. The approach proceeds by comparing successive elements of a sequence of approximations of the iteration, detecting an “increment” that is added to move from one approximation to the next, and extrapolating the sequence by allowing arbitrary repetitions of this increment. The technique applies to finite-word and deterministic weak Büchi automata. Finally, we discuss the implementation of these results within the T(O)RMC toolsets and present case studies that show the advantages and the limits of the approach.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abdulla, P.A., Bouajjani, A., d’Orso, J.: Deciding monotonic games. In: CSL. LNCS, vol. 2803, pp. 1–14. Springer, Berlin (2003)

  2. Abdulla, P.A., Bouajjani, A., Jonsson, B.: On-the-fly analysis of systems with unbounded, lossy FIFO channels. In: CAV. LNCS, vol. 1427, pp. 305–318. Springer, Berlin (1998)

  3. Abdulla, P.A., Delzanno, G., Rezine, A.: Parameterized verification of infinite-state processes with global conditions. In: CAV. LNCS, vol. 4590, pp. 145–157. Springer, Berlin (2007)

  4. Abdulla P.A., Jonsson B.: Verifying programs with unreliable channels. Inf. Comput. 127(2), 91–101 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  5. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J.: Algorithmic improvements in regular model checking. In: CAV. LNCS, vol. 2725, pp. 236–248. Springer, Berlin (2003)

  6. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J., Saksena, M.: Regular model checking for ltl(mso). In: CAV. LNCS, vol. 3114, pp. 348–360. Springer, Berlin (2004)

  7. Abdulla, P.A., Jonsson, B., Nilsson, M., d’Orso, J., Saksena, M.: Regular model checking for ltl(mso). Special Section on Regular Model Checking STTT (2010, in this volume)

  8. Abdulla, P.A., Jonsson, B., Rezine, A., Saksena, M.: Proving liveness by backwards reachability. In: CONCUR. LNCS, vol. 4137, pp. 95–109. Springer, Berlin (2006)

  9. Abdulla, P.A., Legay, A., Rezine, A., d’Orso, J.: Simulation-based iteration of tree transducers. In: TACAS. LNCS, vol. 3440, pp. 30–40. Springer, Berlin (2005)

  10. Adler, B.T., de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Raman, V., Roy, P.: Ticc: A tool for interface compatibility and composition. In: CAV. LNCS, vol. 4144, pp. 59–62. Springer, Berlin (2006)

  11. Alur R., Courcoubetis C., Halbwachs N., Henzinger T.A., Ho P., Nicollin X., Olivero A., Sifakis J., Yovine S.: The algorithmic analysis of hybrid systems. Theor. Compu. Sci. 138(1), 3–34 (1995)

    Article  MATH  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  13. Angluin D.: Learning regular sets from queries and counterexamples. Inf. Comp. 75(2), 87–106 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  14. 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 

  15. Arnold, A.: Finite transition systems: semantics of communicating systems. Prentice Hall International (UK) Ltd., Translator-John Plaice (1994)

  16. Bardin, S., Finkel, A., Leroux, J.: Faster acceleration of counter automata in practice. In: TACAS. LNCS, vol. 2988, pp. 576–590. Springer, Berlin (2004)

  17. Bardin, S., Leroux, J., Point, G.: Fast extended release. In: CAV. LNCS, vol. 4144, pp. 63–66. Springer, Berlin (2006)

  18. Becker, B., Dax, C., Eisinger, J., Klaedtke F. LIRA: handling constraints of linear arithmetics over the integers and the reals. In: CAV. LNCS, vol. 4590, pp. 307–310. Springer, Berlin (2007)

  19. Boigelot B.: Symbolic Methods for Exploring Infinite State Spaces. ULG, Liège (1999)

    Google Scholar 

  20. Boigelot B.: On iterating linear transformations over recognizable sets of integers. Theor. Comput. Sci. 309(1–3), 413–468 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Boigelot, B.: Advance project: deliverables 2004. Technical report, Université de Liège (2004)

  22. Boigelot, B.: Domain-specific regular acceleration. Special Section on Regular Model Checking STTT (2010, in this volume)

  23. Boigelot, B., Godefroid, P.: Symbolic verification of communication protocols with infinite state spaces using qdds (extended abstract). In: CAV. LNCS, vol. 1102, pp. 1–12. Springer, Berlin (1996)

  24. Boigelot, B., Herbreteau, F.: The power of hybrid acceleration. In: CAV. LNCS, vol. 4144, pp. 438–451. Springer, Berlin (2006)

  25. Boigelot, B., Herbreteau, F., Jodogne, S.: Hybrid acceleration using real vector automata. In: CAV. LNCS, vol. 2725, pp. 193–205. Springer, Berlin (2003)

  26. Boigelot, B., Jodogne, S., Wolper, P.: On the use of weak automata for deciding linear arithmetic with integer and real variables. In: IJCAR. LNCS, vol. 2083, pp. 611–625, Siena, Italy. Springer, Berlin (2001)

  27. Boigelot, B., Legay, A., Wolper, P.: Iterating transducers in the large. In: CAV. LNCS, pp. 223–235. Springer, Berlin (2003)

  28. Boigelot, B., Legay, A., Wolper, P.: Omega-regular model checking. In: TACAS. LNCS, vol. 2988, pp. 561–575. Springer, Berlin (2004)

  29. Boigelot, B., Rassart, S., Wolper, P.: On the expressiveness of real and integer arithmetic automata (extended abstract). In: Proceedings of 25th International Colloquium on Automata, Languages and Programming (ICALP). LNCS, vol. 1443, pp. 152–163. Springer, Berlin (1998)

  30. Boigelot, B., Wolper, P.: Symbolic verification with periodic sets. In: CAV. LNCS, volume 818, pp. 55–67. Springer, Berlin (1994)

  31. Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: an overview. In: ICLP. LNCS, vol. 2401, pp. 1–19. Springer, Berlin (2002)

  32. Bouajjani, A., Esparza, J., Maler, O.: Reachability analysis of pushdown automata: application to model-checking. In: CONCUR. LNCS, vol. 1243, pp. 135–150. Springer, Berlin (1997)

  33. Bouajjani, A., Habermehl, P.: Symbolic reachability analysis of fifo channel systems with nonregular sets of configurations. In: ICALP. LNCS, vol. 1256, pp. 560–570. Springer, Berlin (1997)

  34. Bouajjani, A., Habermehl, P., Moro, P., Vojnar, T.: Verifying programs with dynamic 1-selector-linked structures in regular model checking. In: TACAS. LNCS, vol. 3440, pp. 13–29. Springer, Berlin (2005)

  35. Bouajjani, A., Habermehl, P., Rogalewicz, A., Vojnar, T.: Abstract regular (tree) model checking. Special Section on Regular Model Checking STTT (2010, in this volume)

  36. Bouajjani, A., Habermehl, P., Vojnar, T.: Abstract regular model checking. In: CAV. LNCS, vol. 3114, pp. 372–386. Springer, Berlin (2004)

  37. Bouajjani, A., Jonsson, B., Nilsson, M., Touili, T.: Regular model checking. In: CAV. LNCS, vol. 1855, pp. 403–418. Springer, Berlin (2000)

  38. Bouajjani, A., Legay, A., Wolper, P.: Handling liveness properties in (omega-)regular model checking. In: INFINITY. ENTCS, vol. 138(3) Elsevier, Amsterdam (2005)

  39. Bouajjani, A., Touili, T.: Extrapolating tree transformations. In: CAV. LNCS, vol. 2404, pp. 539–554. Springer, Berlin (2002)

  40. Bouajjani, A., Touili, T.: Widening techniques for regular tree model checking. Special Section on Regular Model Checking STTT (2010, in this volume)

  41. Bouyer, P., Cassez, F., Fleury, E., Larsen, K.G.: Synthesis of optimal strategies using hytech. In: GDV, vol. 119, pp. 11–31 (2005)

  42. Broy, M., Jonsson, B., Katoen, J.-P., Leucker, M., Pretschner, A. (eds.): Model-based testing of reactive systems. LNCS, vol. 3472. Springer, Berlin (2005)

  43. Bryant R.: Symbolic boolean manipulation with ordered binary-decision diagrams. ACM Comput. Surv. 24(3), 293–318 (1992)

    Article  Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  45. Cantin, F., Legay, A., Wolper, P.: Computing convex hull by automata iteration. In: CIAA. LNCS, vol. 5148, pp. 112–121. Springer, Berlin (2008)

  46. Dams, D., Lakhnech, Y., Steffen, M.: Iterating transducers. J. Log. Algebraic Program. (JLAP) 52–53:109–127 (2002)

  47. de Alfaro, L., da Silva, L.D., Faella, M., Legay, A., Roy, P., Sorea, M.: Sociable interfaces. In: FROCOS. LNCS, vol. 3717, pp. 81–105. Springer, Berlin (2005)

  48. de Alfaro, L., Henzinger, T.A.: Interface theories for component-based design. In: EMSOFT, LNCS, vol. 2211, pp. 148–165. Springer, Berlin (2001)

  49. de Alfaro, L., Henzinger, T.A., Majumdar, R.: Symbolic algorithms for infinite-state games. In: CONCUR. LNCS, vol. 2154, pp. 536–550. Springer, Berlin (2001)

  50. Delzano, G., Rezine, A.: A lightweight regular model checking approach for parameterized systems. Special Section on Regular Model Checking STTT (2010, in this volume)

  51. Eisinger, J., Klaedtke, F.; Don’t care words with an application to the automata-based approach for real addition. In: CAV. LNCS, vol. 4144, pp. 67–80. Springer, Berlin (2006)

  52. Finkel, A., Leroux, J.: How to compose presburger-accelerations: Applications to broadcast protocols. In: FSTTCS. LNCS, vol. 2556, pp. 145–156. Springer, Berlin (2002)

  53. Finkel, A., Willems, B., Wolper, P.: A direct symbolic approach to model checking pushdown systems. In: INFINITY. ENTCS, vol. 9. Elsevier Science Publishers, Amsterdam (1997)

  54. Fisman, D., Pnueli, A.: Beyond regular model checking. In: FSTTCS. LNCS, vol. 2245, pp. 156–170. Springer, Berlin (2001)

  55. Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. In: INFINITY. ENTCS, vol. 138(3). Elsevier Science Publishers, Amsterdam (2004)

  56. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Theory Mach. Comput. 71(192), 189–196 (1971)

  57. Jonsson, B., Nilsson, M.: Transitive closures of regular relations for verifying infinite-state systems. In: TACAS. LNCS, vol. 1785, pp. 220–234. Springer, Berlin (2000)

  58. Kesten, Y., Maler, O., Marcus, M., Pnueli, A., Shahar, E.: Symbolic model checking with rich assertional languages. In: CAV. LNCS, vol. 1254, pp. 424–435. Springer, Berlin (1997)

  59. Legay A.: Generic Techniques for the Verification of Infinite-State Systems. Collection des publications de la Faculté des Sciences Appliquées de l’Université de Liège, Liège (2007)

    Google Scholar 

  60. Legay, A.: T(o)rmc: a tool for (omega-)regular model checking. In: CAV. LNCS, vol. 5123, pp. 548–551. Springer, Berlin (2008)

  61. Legay A., Wolper P.: (Omega-)regular model checking. ACM TOCL 12(1), 46–90 (2011)

    MathSciNet  Google Scholar 

  62. Löding C.: Efficient minimization of deterministic weak ω-automata. Inf. Process. Lett. 79(3), 105–109 (2001)

    Article  MATH  Google Scholar 

  63. Lynch N.: Distributed Algorithms. Kaufmann, San Fransisco (1996)

    MATH  Google Scholar 

  64. Miné, A.: The octagon abstract domain. In: WCRE, p. 310 (2001)

  65. Muller, D.E., Saoudi, A., Schupp, P.E.: Alternating automata, the weak monadic theory of the tree and its complexity. In: ICALP, pp. 275–283. Springer, Berlin (1986)

  66. Nilsson, M.: Regular model checking. Master’s thesis, Uppsala University (2001)

  67. Nilsson, M.: Regular model checking. PhD thesis, Uppsala University (2005)

  68. Peterson J.: Petri Net Theory and the Modeling of Systems. Prentice Hall, Boston (1981)

    Google Scholar 

  69. Safra, S.: Exponential determinization for ω-automata with strong-fairness acceptance condition. In: Proceedings of the 24th ACM Symposium on Theory of Computing, Victoria (1992)

  70. Simons D.P.L., Stoelinga M.: Verification of the ieee 1394a root contention protocol using uppaal2k. STTT 3(4), 469–485 (2001)

    MATH  Google Scholar 

  71. The Liège Automata-based Symbolic Handler (LASH). http://www.montefiore.ulg.ac.be/~boigelot/research/lash/

  72. The parma polyhedra library. http://www.cs.unipr.it/ppl/

  73. The regular model checking tool (RMC). http://www.it.uu.se/research/docs/fm/apv/rmc

  74. Touili, T.: Regular model checking using widening techniques. In: ENTCS, vol. 50(4), pp. 342–356 (2001)

  75. Touili, T.: Analyse Symbolique de Systèmes infinis basée sur les automates: Application à la vérification de systèmes paramétrés. PhD thesis, Paris 7 (2003)

  76. Vardhan, A.: Learning to verify systems. PhD thesis, Univeristy of Illinois (2006)

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

  78. Vardhan, A., Viswanathan, M.: Lever: a tool for learning based verification. In: CAV. LNCS, vol. 4144, pp. 471–474. Springer, Berlin (2006)

  79. Vardi, M.Y.: From church and prior to psl (2007)

  80. Wolper, P., Boigelot, B.: An automata-theoretic approach to presburger arithmetic constraints (extended abstract). In: Proceedings of 2nd International Symposium on Static Analysis (SAS). LNCS, vol. 983, pp. 21–32. Springer, Berlin (1995)

  81. Wolper, P., Boigelot, B.: Verifying systems with infinite but regular state spaces. In: CAV, LNCS, vol. 1427, pp. 88–97. Springer, Berlin (1998)

  82. Wolper, P., Boigelot, B.: On the construction of automata from linear arithmetic constraints. In: TACAS. LNCS, vol. 1785, pp. 1–19. Springer, Berlin (2000)

Download references

Author information

Authors and Affiliations

  1. INRIA/IRISA, Rennes, France

    Axel Legay

Authors
  1. Axel Legay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Axel Legay.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Legay, A. Extrapolating (omega-)regular model checking. Int J Softw Tools Technol Transfer 14, 119–143 (2012). https://doi.org/10.1007/s10009-011-0209-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10009-011-0209-7

Keywords

Search

Navigation