Skip to main content
SpringerLink
Log in
Book cover

International Conference on Concurrency Theory

CONCUR 2002: CONCUR 2002 — Concurrency Theory pp 116–131Cite as

Regular Model Checking Made Simple and Effcient*

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2421))

Abstract

Wepresent a new technique for computing the transitive closure of a regular relation characterized by a finite-state transducer. The construction starts from the original transducer, and repeatedly adds new transitions which are compositions of currently existing transitions. Furthermore, we define an equivalence relation which we use to merge states of the transducer during the construction. The equivalence relation can be determined by a simple local check, since it is syntactically characterized in terms of “columns” that label constructed states. This makes our algorithm both simpler to present and more efficient to implement, compared to existing approaches. We have implemented a prototype and carried out verification of a number of parameterized protocols.

This work was supported in part by the European Commission (FET project ADVANCE, contract No IST-1999-29082).

This author is supported in part by Vetenskapsrådet, the Swedish Research Council (http://www.vr.se/).

This author is supported in part by ARTES, the Swedish network for real-time research (http://www.artes.uu.se/).

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy fifo channels. In Proc. CAV’ 98, volume 1427 of LNCS, pages 305–318, 1998.

    Google Scholar 

  2. Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In Proc. CAV’99, volume 1633 of LNCS, pages 134–145, 1999.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In Proc. CONCUR’97. LNCS 1243, 1997.

    Google Scholar 

  5. B. Boigelot, J.-M. FranÇois, and L. Latour. The Liége automata-based symbolic handler (lash). Available at http://www.montefiore.ulg.ac.be/~boigelot/ research/lash/.

  6. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Alur and Henzinger, editors, Proc. CAV’96, volume 1102 of LNCS, pages 1–12. Springer Verlag, 1996.

    Google Scholar 

  7. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, LNCS. Springer Verlag, 1997.

    Google Scholar 

  8. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifochannel systems with nonregular sets of configurations. In Proc. ICALP’ 97, 24th International Colloquium on Automata, Lnaguages, and Programming, volume 1256 of LNCS, 1997.

    Google Scholar 

  9. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Emerson and Sistla, editors, Proc. CAV ⫗0, volume 1855 of LNCS, pages 403–418, 2000.

    Google Scholar 

  10. A. Bouajjani, A. Muscholl, and T. Touili. Permutation rewriting and algorithmic verification. In Proc. LICS’ 01 17th IEEE Int. Symp. on Logic in Computer Science. IEEE, 2001.

    Google Scholar 

  11. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. CAV’94, volume 818 of LNCS, pages 55–67. Springer Verlag, 1994.

    Google Scholar 

  12. Didier Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, Nov. 1992.

    Article  MathSciNet  Google Scholar 

  13. Didier Caucal. On word rewriting systems having a rational derivation. In FOSSACS 2000, volume 1784 of LNCS, pages 48–62, April 2000.

    Google Scholar 

  14. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In CAV’98. LNCS 1427, 1998.

    Google Scholar 

  15. D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Proc. CAV’ 01, volume 2102 of LNCS, 2001.

    Google Scholar 

  16. J. Esparza and S. Schwoon. A bdd-based model checker for recursive programs. In Proc. CAV’01, volume 2102 of LNCS, pages 324–336, 2001.

    Google Scholar 

  17. A. Finkel, B. Willems, and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In Proc. Infinity’ 97, Electronic Notes in Theoretical Computer Science, Bologna, 1997.

    Google Scholar 

  18. J. G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Proc. TACAS’95, volume 1019 of LNCS, 1996.

    Google Scholar 

  19. Bengt Jonsson and Marcus Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In S. Graf and M. Schwartzbach, editors, Proc. TACAS’00, volume 1785 of LNCS, 2000.

    Google Scholar 

  20. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. CAV’97, volume 1254, pages 424–435, Haifa, Israel, 1997. Springer Verlag.

    Google Scholar 

  21. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: A fiexible toolset for monadic second-order logic. In Proc. TACAS’97, volume 1217 of LNCS, pages 183–202, Heidelberg, Germany, March 1997. Springer Verlag.

    Google Scholar 

  22. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. CAV '00, volume 1855 of LNCS, pages 328–343, 2000.

    Google Scholar 

  23. T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001. Proc. Workshop on Verification of Parametrized Systems (VEPAS’01), Crete, July, 2001.

    Google Scholar 

  24. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. CAV’98, volume 1427 of LNCS, pages 88–97, Vancouver, July 1998. Springer Verlag.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Systems, P.O. Box 337, S-751 05, Uppsala, Sweden

    Parosh Aziz Abdulla, Bengt Jonsson, Marcus Nilsson & Julien d'Orso

Authors
  1. Parosh Aziz Abdulla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bengt Jonsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Marcus Nilsson
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Julien d'Orso
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Masaryk University Brno, Botanicka 68a, 60200, Brno, Czech Republic

    Luboš Brim , Mojmír Křetínský  & Antonín Kučera ,  & 

  2. Faculty of Electrical Engineering and Informatics, Department of Computer Science, Technical University of Ostrava (VSB), 17. listopadu 15, 70833, Ostrava-Poruba, Czech Republic

    Petr Jančar

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Abdulla, P.A., Jonsson, B., Nilsson, M., d'Orso, J. (2002). Regular Model Checking Made Simple and Effcient* . In: Brim, L., Křetínský, M., Kučera, A., Jančar, P. (eds) CONCUR 2002 — Concurrency Theory. CONCUR 2002. Lecture Notes in Computer Science, vol 2421. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45694-5_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45694-5_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44043-7

  • Online ISBN: 978-3-540-45694-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation