Abstract
In this paper, we describe a first-order linear time temporal logic (LTL) model checker based on multiway decision graphs (MDG). We developed a first-order temporal language, \(\cal{L}_{MDG}^*\), which expresses a subset of many-sorted first-order LTL and extends an earlier language, \(\cal{L}_{MDG}\), defined for an MDG based abstract CTL model checking. We derived a set of rules, enabling the transformation of \(\cal{L}_{MDG}^*\) formulas into generalized Büchi automata (GBA). The product of this GBA and the abstract state machine (ASM) model is checked for language emptiness. We have lifted two instances of the generalized Strongly Connected Component(SCC)-hull (GSH) checking algorithm [17] to support abstract data and uninterpreted functions based on operators available in the MDG package. Experimental results have shown the superiority of our tool compared to the same instances of GSH implemented with BDDs in VIS.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ait-Mohamed, O., Song, X., Cerny, E.: On the non-termination of MDG-based abstract state enumeration. Theoretical Computer Science 300, 161–179 (2003)
Bloem, R., Ravi, K., Somenzi, F.: Efficient decision procedures for model checking of linear time logic properties. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 222–235. Springer, Heidelberg (1999)
Bohn, J., Damm, W., Grumberg, O., Hungar, H., Laster, K.: First-order-CTL model checking. In: Foundations of Software Technology and Theoretical Computer Science, pp. 283–294 (1998)
Burch, J.R., Dill, D.L.: Automatic verification of pipelined microprocessor control. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 68–80. Springer, Heidelberg (1994)
Corella, F., Zhou, Z., Song, X., Langevin, M., Cerny, E.: Multiway decision graphs for automated hardware verification. Formal Methods in System Design 10(1), 7–46 (1997)
Cyrluk, D., Narendran, P.: Ground temporal logic: A logic for hardware verification. In: Dill, D.L. (ed.) CAV 1994. LNCS, vol. 818, pp. 247–259. Springer, Heidelberg (1994)
Daniele, M., Giunchiglia, F., Vardi, M.Y.: Improved automata generation for linear temporal logic. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 249–260. Springer, Heidelberg (1999)
Emerson, E.A., Lei, C.-L.: Efficient model checking in fragments of the propositional μ-calculus. In: Proceedings of the First Annual Symposium on Logic in Computer Science, pp. 267–278. IEEE Computer Society Press, Los Alamitos (1986)
Fisler, K., Fraer, R., Kamhi, G., Vardi, M.Y., Yang, Z.: Is there a best symbolic cycle-detection algorithm? In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 420–434. Springer, Heidelberg (2001)
Somenzi, F., Bloem, R.: Efficient Büchi automata from LTL formulae. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 247–263. Springer, Heidelberg (2000)
Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple on-the-fly automatic verification of linear temporal logic. In: Protocol Specification, Testing, and Verification, Warsaw, Poland, pp. 3–18. North-Holland, Amsterdam (1995)
Hardin, R.H., Kurshan, R.P., Shukla, S.K., Vardi, M.Y.: A new heuristic for bad cycle detection using BDDs. Formal Methods in System Design 18(2), 131–140 (2001)
Hojati, R., Brayton, R.K.: Automatic datapath abstraction in hardware systems. In: Wolper, P. (ed.) CAV 1995. LNCS, vol. 939, pp. 98–113. Springer, Heidelberg (1995)
Kurshan, P.: Automata-Theoretic Verification of Coordinating Processes. Princeton University Press, Princeton (1994)
Leslie, I., McAuley, D.: Fairisle: an ATM network for the local area. ACM communication review 19, 327–336 (1991)
Ravi, K., Bloem, R., Somenzi, F.: A comparative study of symbolic algorithms for the computation of fair cycles. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 143–160. Springer, Heidelberg (2000)
Somenzi, F., Ravi, K., Bloem, R.: Analysis of symbolic scc hull algorithms. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 88–105. Springer, Heidelberg (2002)
Tahar, S., Song, X., Cerny, E., Zhou, Z., Langevin, M., Ait-Mohamed, O.: Modeling and verification of the fairisle ATM switch fabric using mdgs. IEEE Transactions on CAD of Integrated Circuits and Systems 18(7), 956–972 (1999)
Vardi, M.Y.: An automata-theoretic approach to linear temporal logic. In: Moller, F., Birtwistle, G. (eds.) Logics for Concurrency. LNCS, vol. 1043, pp. 238–266. Springer, Heidelberg (1996)
Wang, F.: Automata based model checking using multiway decision graphs. Technical Report, Concordia University (2004), Available online at: http://www.ece.concordia.ca/~fwang/MDGLECreport.ps
Xu, Y., Cerny, E., Song, X., Corella, F., Ait Mohamed, O.: Model checking for a first-order temporal logic using multiway decision graphs. In: Y. Vardi, M. (ed.) CAV 1998. LNCS, vol. 1427, pp. 219–231. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, F., Tahar, S., Mohamed, O.A. (2004). First-Order LTL Model Checking Using MDGs. In: Wang, F. (eds) Automated Technology for Verification and Analysis. ATVA 2004. Lecture Notes in Computer Science, vol 3299. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30476-0_36
Download citation
DOI: https://doi.org/10.1007/978-3-540-30476-0_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23610-8
Online ISBN: 978-3-540-30476-0
eBook Packages: Springer Book Archive