Skip to main content
Log in

Symbolic Verification and Analysis of Discrete Timed Systems

  • Published:
Formal Methods in System Design Aims and scope Submit manuscript

Abstract

This paper presents a novel approach for real-time model checking. It combines the efficiency of traditional symbolic model checking with possibilities to describe and specify real-time systems. Using multi-terminal binary decision diagrams to represent time and time intervals, it becomes possible to transfer efficient algorithms and optimization heuristics known from standard CTL model checking to real-time applications. By introducing a new variant of models called I/O-interval structures we can describe systems in a modular way. Interval structures allow model composition of real-time structures such that state explosion effects are greatly reduced. Besides model checking we also present analysis algorithms which allow to compute key properties like system latencies and minimal response times from the structures describing the system. The practical applicability is proven by experimental results, computed by the verification system RAVEN, which implements all described algorithms, including counterexample generation and waveform visualization.

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

Access this article

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. R. Alur, C. Courcoubetis, and D. Dill, “Model checking in dense real time,” Information and Computation, Vol. 104, No. 1, pp. 2–34, 1993. Academic Press.

    Google Scholar 

  2. E. Asarin, M. Bozga, A. Kerbrat, O. Maler, M. Pnueli, and A. Rasse, “Data structures for the verification of timed automata,” in O. Maler (Ed.), Hybrid and Real-Time Systems, Grenoble, France, Springer Verlag, LNCS 1201, 1997, pp. 346–360.

    Google Scholar 

  3. R. Bahar, E. Frohm, C. Gaona, G. Hachtel, E. Macii, A. Pardo, and F. Somenzi, “Algebraic decision diagrams and their applications,” in IEEE/ACM International Conference on Computer Aided Design (ICCAD), Santa Clara, California, November 1993, pp. 188–191. ACM/IEEE, IEEE Computer Society Press.

  4. W. Belluomini and C. Myers, “Timed state space exploration using POSETs,” IEEE Transaction on CAD, Vol. 19, No. 5, 2000.

  5. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and W. Yi, “Uppaal—A tool suite for automatic verification of real-time systems,” in Proc. of Workshop on Verification and Control of Hybrid Systems III, Number 1066 in Lecture Notes in Computer Science, Springer-Verlag, October 1995, pp. 232–243.

  6. M. Bozga, “SMI: An open toolbox for symbolic protocol verification,” Technical Report, VERIMAG, 1997.

  7. M. Browne, “An improved algorithm for automatic verification of finite-state machines using temporal logic,” in IEEE Symposium on Logic in Computer Science (LICS), Boston, Massachusetts, IEEE Computer Society Press, June 1986, pp. 260–266.

    Google Scholar 

  8. R. Bryant, “Graph-based algorithms for boolean function manipulation,” IEEE Transactions on Computers, Vol. C-35, No. 8, pp. 677–691, 1986.

    Google Scholar 

  9. J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang, “Symbolic model checking: 1020 states and beyond,” in IEEE Symposium on Logic in Computer Science (LICS), Washington, DC, IEEE Computer Society Press, June 1990, pp. 1–33.

    Google Scholar 

  10. S. Campos and E. Clarke, “Real-time symbolic model checking for discrete time models,” in T. Rus and C. Rattray (Eds.), Theories and Experiences for Real-Time System Development, AMAST Series in Computing. World Scientific Press, AMAST Series in Computing, May 1994.

  11. S. Campos, E. Clarke, and M. Minea, “The verus tool: A quantitative approach to the formal verification of real-time systems,” in O. Grumberg, (Ed.), Conference on Computer Aided Verification (CAV), Vol. 1254, pp. 452–455 of Lecture Notes in Computer Science, Springer Verlag, June 1997.

  12. E. Clarke, E. Emerson, and A. Sistla, “Automatic verification of finite-state concurrent systems using temporal logic,” in ACM Symposium on Principles of Programming Languages (POPL), 1983.

  13. E.M. Clarke, O. Grumberg, D.E. Long, “Model checking,” in Springer-Verlag Nato ASI Series F, Vol. 152, 1996 (A survey on model checking, abstraction and composition).

  14. E. Clarke, K. McMillian, X. Zhao, M. Fujita, and J.-Y. Yang, “Spectral transforms for large Boolean functions with application to technology mapping,” in ACM/IEEE Design Automation Conference (DAC), Dallas, TX, June 1993, pp. 54–60.

  15. S. Davari and L. Sha, “Sources of unbounded priority inversion in real-time systems and a comperative study of possible solutions,” in ACM Operating Systems Review, April 1992, pp. 110–120.

  16. C. Daws, A. Olivero, S. Tripakis, and S. Yovine, “The tool KRONOS,” in Hybrid Systems III, Vol. 1066 LNCS. Springer, 1996.

  17. E. Emerson, “Temporal and modal logic,” in Handbook of Theoretical Computer Science, J. van Leeuwen (Ed.), Vol. B, pp. 996–1072, Amsterdam, Elsevier Science Publishers, 1990.

    Google Scholar 

  18. E. Emerson, A. Mok, A. Sistla, and J. Srinivasan, “Quantitative temporal reasoning,” Journal of Real-Time Systems, Vol. 4, pp. 331–352, 1992.

    Google Scholar 

  19. J. Frö βl, J. Gerlach, and T. Kropf, “An efficient algorithm for real-time model checking,” in European Design and Test Conference (EDTC), Paris, France, IEEE Computer Society Press (Los Alamitos, California), March 1996, pp. 15–21.

    Google Scholar 

  20. T. Henzinger, X. Nicollin, J. Sifakis, and S. Yovine, “Symbolic model checking for real-time systems,” in IEEE Symposium on Logic in Computer Science (LICS), Santa-Cruz, California, IEEE Computer Scienty Press, June 1992, pp. 394–406.

    Google Scholar 

  21. S. Johnson, P. Miner, and A. Camilleri, “Studies of the single pulser in various reasoning systems,” in T. Kropf and R. Kumar (Eds.), International Conference on Theorem Provers in Circuit Design (TPCD), Volume 901 of Lecture Notes in Computer Science, Bad Herrenalb, Germany, September 1994. Springer-Verlag, pp. 126–145, published 1995.

  22. C. Lewerentz and T. Lindner (Eds.), Formal Development of Reactive Systems—Case Study Production Cell, number 891 in Lecture Notes in Computer Science (LNCS). Springer Verlag, 1995.

  23. J. Lipson (Ed.), Elements of Algebra and Algebraic Computing. The Benjamin/Cummings Publishing Company, Inc., 1981.

  24. K. McMillan, “The SMV system, symbolic model checking—An approach,” Technical Report CMU-CS-92-131, Carnegie Mellon University, 1992.

  25. J. Moller, J. Lichtenberg, H.R. Andersen, and H. Hulgaard, “Fully symbolic model checking of timed systems using difference decision diagrams,” in Electronic Notes in Theoretical Computer Science, Vol 23, 1999, Elsevier Science B. V.

  26. D. Peled, V. Pratt, and G. Holzman, (Eds.), Partial Order Methods in Verification, Volume 29 of DIMACS. AMS, 1996.

  27. W. Reif, J. Ruf, G. Schellhorn, and T. Vollmer, “Do you trust your model checker?” in S. Johnson and W.A. Hunt (Eds.), Formal Methods in Computer Auded Design (FMCAD), Lecture Notes in Computer Science, Heidelberg, Springer-Verlag, November 2000.

    Google Scholar 

  28. J. Ruf, “RAVEN: Real-time analyzing and verification environment,” Technical Report, WSI 2000-3, University of Tübingen, Germany, 2000.

  29. J. Ruf, “Data analysis of timed finite state systems,” in Workshop on Methods and Languages for Modeling and Verification of Circuits and Systems,” February 2001, Meissen, Germany. MoPress

    Google Scholar 

  30. J. Ruf and T. Kropf, “Symbolic model checking for a discrete clocked temporal logic with intervals,” in E. Cerny and D. Probst (Eds.), Conference on Correct Hardware Design and Verification Methods (CHARME), Montreal, Canada, IFIP WG 10.5, Chapman and Hall, October 1997, pp. 146–166

  31. J. Ruf and T. Kropf, “Using MTBDDs for composition and model checking of real-time systems,” in FMCAD 1998, Springer, November 1998.

  32. J. Ruf and T. Kropf, “Using MTBDDs for discrete timed symbolic model checking,” Multiple-Valued Logic—An International Journal. Special Issue on Decision Diagrams. Gordon and Breach Publishers, 1998.

  33. J. Ruf and T. Kropf, “Modeling and checking networks of communicating real-time processes.” in Correct Hardware Design and Verification Methods (CHARME), L. Pierre and T. Kropf (Eds.), Volume 1703, pp. 256–279 of Lecture Notes in Computer Science, Heidelberg, Germany, Springer-Verlag, September 1999.

    Google Scholar 

  34. SAE, “J1850 class B data communication network interface,” The Engineering Society For Advancing Mobility Land Sea Air and Space, October 1995.

  35. Karsten Strehl, “Interval diagrams: Increasing efficiency of symbolic real-time verification,” in 6th International Conference on Real-Time Computing Systems and Applications (RTCSA '99), Hong Kong, December 13-15, 1999, pp. 488–491.

  36. F. Wang, “Efficient data structure for fully symbolic verification of real-time software systems,” in Proceedings of TACAS'2000, LNCS 1785, Springer-Verlag.

  37. W. Yi, P. Petterson, and M. Davis, “Automatic verification of real-time communicating systems by constraint solving,” in 7th International Conference on Formal Description Techniques, Bern, Switzerland, Springer, October 1994.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ruf, J., Kropf, T. Symbolic Verification and Analysis of Discrete Timed Systems. Formal Methods in System Design 23, 67–108 (2003). https://doi.org/10.1023/A:1024437214071

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024437214071

Navigation