Improved BDD-Based Discrete Analysis of Timed Systems
Model checking timed systems through digitization is relatively easy, compared to zone-based approaches. The applicability of digitization, however, is limited mainly for two reasons, i.e., it is only sound for closed timed systems; and clock ticks cause state space explosion. The former is mild as many practical systems are subject to digitization. It has been shown that BDD-based techniques can be used to tackle the latter to some extent. In this work, we significantly improve the existing approaches by keeping the ticks simple in the BDD encoding. Taking advantage of the ‘simple’ nature of clock ticks, we fine-tune the encoding of ticks and are able to verify systems with many ticks. Furthermore, we develop a BDD library which supports not only encoding/verifying of timed state machines (through digitization) but also composing timed components using a rich set of composition functions. The usefulness and scalability of the library are demonstrated by supporting two languages, i.e., closed timed automata and Stateful Timed CSP.
KeywordsModel Check Linear Temporal Logic Symbolic Model Check Time Automaton State Space Explosion
Unable to display preview. Download preview PDF.
- 1.Berthomieu, B., Menasche, M.: An Enumerative Approach for Analyzing Time Petri Nets. In: IFIP Congress, pp. 41–46 (1983)Google Scholar
- 3.Havelund, K., Skou, A., Larsen, K.G., Lund, K.: Formal Modeling and Analysis of an Audio/video Protocol: an Industrial Case Study using UPPAAL. In: RTSS, pp. 2–13 (1997)Google Scholar
- 10.Sun, J., Liu, Y., Dong, J.S., Liu, Y., Shi, L., André, E.: Modeling and Verifying Hierarchical Real-time Systems using Stateful Timed CSP. ACM Transactions on Software Engineering and Methodology (2011) (to appear)Google Scholar
- 11.Nguyen, T.K., Sun, J., Liu, Y., Dong, J.S., Liu, Y.: BDD-based Discrete Analysis of Timed Systems, http://www.comp.nus.edu.sg/%7Epat/bddlib/
- 12.Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic Model Checking with Partitioned Transistion Relations. In: VLSI, pp. 49–58 (1991)Google Scholar
- 14.Jin, X.L., Ma, H.D., Gu, Z.H.: Real-Time Component Composition Using Hierarchical Timed Automata. In: QSIC, pp. 90–99. IEEE (2007)Google Scholar
- 15.David, A., David, R., Möller, M.O.: From HUPPAAL to UPPAAL - A Translation from Hierarchical Timed Automata to Flat Timed Automata. Technical report, Department of Computer Science, University of Aarhus (2001)Google Scholar
- 16.Hoare, C.A.R.: Communicating Sequential Processes. International Series in Computer Science. Prentice-Hall (1985)Google Scholar
- 19.Vardi, M.Y., Wolper, P.: An Automata-Theoretic Approach to Automatic Program Verification. In: LICS, pp. 332–344. IEEE Computer Society (1986)Google Scholar
- 20.Wang, H., MacCaull, W.: Verifying Real-Time Systems using Explicit-time Description Methods. In: QFM. EPTCS, vol. 13, pp. 67–78 (2009)Google Scholar