Abstract
When extending CTL with constructs for quantitative reasoning on time, either the linear algorithm complexity of standard model checking gets lost, efficient ROBDD techniques are no more applicable or the semantics becomes counter intuitive.
In this paper, we present a new approach to symbolic QCTL (Quantitative CTL) model checking. In contrast to previous approaches we use an intuitive QCTL semantics, provide an efficient model representation and the new algorithms require less iteration steps compared to translating the QCTL problem into CTL and using standard CTL model checking techniques. The approach is based on the observation, that we can identify two different state sets in temporal structures: main states, which constitute the reachability graph, and intermediate states, which are necessary to give a semantics to the timed state transitions. To represent intermediate states symbolically, we generalize the notion of characteristic functions. These functions are represented using multi-terminal BDDs (MTBDDs). The paper presents the new model checking algorithm as well as experimental results, showing the efficiency of the new approach.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
S. Davari and L. Sha. Sources of unbounded priority inversion in real-time systems and a comparative study of possible solutions. In Operating Systems Review, pages 110–120. ACM, April 1992.
M. Fujita E. Clarke and X. Zhao. Applications of multi-terminal binary decision diagrams. Technical Report CMU-CS-95-160, School of Computer Science Carnegie Mellon University, Pittsburgh, PA 15213, April 1995.
E. Clarke, K.L. McMillian, X. Zhao, M. Fujita, and J.C.-Y. Yang. Spectral Transforms for large Boolean Functions with Application to Technologie Mapping. In 30th ACM/IEEE Design Automation Conference, pages 54–60, Dallas, TX, June 1993.
E. Clarke, O. Grumberg, and D. Long. Verification Tools for Finite State Concurrent Systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, A Decade of Concurrency-Reflections and Perspectives, volume 803 of Lecture Notes in Computer Science, pages 124–175, Noordwijkerhout, Netherlands, June 1993. REX School/Symposium, Springer-Verlag.
E.M. Clarke, E. A. Emerson, and A.P. Sistla. Automatic Verification of Finite-State Concurrent Systems Using Temporal Logic Specifications. ACM Transactions on Programming Languages and Systems, 8(2):244–263, April 1986.
H. Eveking. private communication, March 1996.
J. Frößl, J. Gerlach, and T. Kropf. An Efficient Algorithm for Real-Time Model Checking. In In Proccedings of the European Design and Test Conference, pages 15–21, Paris, France, March 1996. IEEE Computer Society Press (Los Alamitos, California).
J. Lipson, editor. Elements of Algebra and Algebraic Computing. The Benjamin/Cummings Publishing Company, Inc., 1981.
J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic Model Checking: 1020 States and Beyond. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 1–33, Washington, D.C., June 1990. IEEE Computer Society Press.
K.L. McMillan. The SMV system, symbolic model checking — an approach. Technical Report CMU-CS-92-131, Carnegie Mellon University, 1992.
T. Kropf and J. Ruf. Using MTBDDs for Discrete Timed Symbolic Model Checking. Technical Report of the SFB 358, August 1996.
R. Alur, C. Courcoubetics, and D.L. Dill. Model Checking for Real-Time Systems. In Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science, pages 414–425, Washington, D.C., June 1990. IEEE Computer Society Press.
R. Rajkumar. Task synchronisation in real-time systems. PhD thesis, Carnegie Mellon University, 1989.
R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
S.V. Campos and E. Clarke. Real-Time Symbolic Model Checking for Discrete Time Models. In T. Rus and C. Rattray, editors, Theories and Experiences for Real-Time System Develpment, AMAST Series in Computing. World Scientific Press, AMAST Series in Computing, May 1994.
T.A. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine. Symbolic Model Checking for Real-Time Systems. In 7th. Symposium of Logics in Computer Science, pages 394–406, Santa-Cruz, California, June 1992. IEEE Computer Scienty Press.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruf, J., Kropf, T. (1997). A new algorithm for discrete timed symbolic model checking. In: Maler, O. (eds) Hybrid and Real-Time Systems. HART 1997. Lecture Notes in Computer Science, vol 1201. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014710
Download citation
DOI: https://doi.org/10.1007/BFb0014710
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62600-8
Online ISBN: 978-3-540-68330-8
eBook Packages: Springer Book Archive