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 to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
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.
A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In Proc. CONCUR’97. LNCS 1243, 1997.
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/.
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.
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.
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.
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.
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.
B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. CAV’94, volume 818 of LNCS, pages 55–67. Springer Verlag, 1994.
Didier Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61–86, Nov. 1992.
Didier Caucal. On word rewriting systems having a rational derivation. In FOSSACS 2000, volume 1784 of LNCS, pages 48–62, April 2000.
H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In CAV’98. LNCS 1427, 1998.
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.
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.
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.
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.
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.
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.
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.
A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. CAV '00, volume 1855 of LNCS, pages 328–343, 2000.
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.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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