Abstract
This paper aims at developing a technique for checking if a timed automaton satisfies a linear duration constraint on the automaton states. The constraints are represented in the form of linear duration invariants – a simple class of chop-free Duration Calculus (DC) formulas. We prove that linear duration invariants of timed automata are discretisable, and reduce checking if a timed automaton satisfies a linear duration invariant to checking if the integer timed region graph of the original automaton satisfies the same linear duration invariant. The latter can be done with exhaustive search on graphs. In comparison to the techniques in the literature, our method is more powerful: it works for the standard semantics of DC and the class of the closed timed automata while the others cannot be applied.
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
Alur, R., Dill, D.L.: A Theory of Timed Automata. Theoretical Computer Science, pp. 183–235 (1994)
Alur, R.: Timed automata. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol. 1633, pp. 8–22. Springer, Heidelberg (1999)
Braberman, V.A., Van Hung, D.: On Checking Timed Automata for Linear Duration Invariants. Technical Report 135, UNU/IIST, P.O.Box 3058, Macau (February 1998). In: Proceedings of the 19th Real-Time Systems Symposium RTSS 1998, Madrid, Spain, December 2–4, 1998, pp. 264–273. IEEE Computer Society Press, Los Alamitos (1998)
Clarke, E., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)
Kesten, Y., Pnueli, A., Sifakis, J., Yovine, S.: Integration Graphs: A Class of Decidable Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736, pp. 179–208. Springer, Heidelberg (1993)
Henzinger, T.A., Manna, Z., Pneuli, A.: Towards Refining Temporal Specifications into Hybrid Systems. In: Grossman, R.L., Ravn, A.P., Rischel, H., Nerode, A. (eds.) HS 1991 and HS 1992. LNCS, vol. 736. Springer, Heidelberg (1993)
Dong, L.X., Hung, D.V.: Checking Linear Duration Invariants by Linear Programming. Research Report 70, UNU/IIST, P.O.Box 3058, Macau (May 1996). In: Jaffar, J., Yap, R.H.C. (eds.) ASIAN 1996. LNCS, vol. 1179, Springer, Heidelberg (1996)
Yong, L., Hung, D.V.: Checking Temporal Duration Properties of Timed Automata. Technical Report 214, UNU/IIST, P.O.Box 3058, Macau (October 2001); Published in Journal of Computer Science and Technology 17(6), pp. 689–698 (2002)
Thai, P.H., Van Hung, D.: Checking a Regular Class of Duration Calculus models for Linear Duration Invariants. Technical Report 118, UNU/IIST, P.O.Box 3058, Macau (July 1997); Kramer, B., Uchihira, N., Croll, P., Russo, S. (eds.)Proceedings of the International Symposium on Software Engineering for Parallel and Distributed Systems (PDSE 1998), Kyoto, Japan, April 20-21, pp. 61–71. IEEE Press, Los Alamitos (1998)
Thai, P.H., Van Hung, D.: Verifying Linear Duration Constraints of Timed Automata. Technical Report 306, UNU/IIST, P.O.Box 3058, Macau (June 2004)
Tripakis, S., Yovine, S.: Analysis of timed systems based on time-abstracting bisimulations. In: Formal Methods in System Design, vol. 18, pp. 25–68. Kluwer Academic Publishers, Boston (2001)
Jianhua, Z., Van Hung, D.: Checking Timed Automata for Some Discretisable Duration Properties. Technical Report 145, UNU/IIST, P.O.Box 3058, Macau (August 1998); Published in Journal of Computer Science and Technology 15(5), 423–429 (2000)
Chaochen, Z., Hoare, C.A.R., Ravn, A.P.: A calculus of durations. Information Processing Letters 40(5), 269–276 (1991)
Chaochen, Z., Jingzhong, Z., Lu, Y., Xiaoshan, L.: Linear Duration Invariants. Research Report 11, UNU/IIST, P.O.Box 3058, Macau (July 1993). In: Langmaack, H., de Roever, W.-P., Vytopil, J. (eds.) FTRTFT 1994 and ProCoS 1994. LNCS, vol. 863, Springer, Heidelberg (1994)
Chaochen, Z.: Duration Calculus. A Formal Approach to Real-Time Systems. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Thai, P.H., Van Hung, D. (2005). Verifying Linear Duration Constraints of Timed Automata. In: Liu, Z., Araki, K. (eds) Theoretical Aspects of Computing - ICTAC 2004. ICTAC 2004. Lecture Notes in Computer Science, vol 3407. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31862-0_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-31862-0_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25304-4
Online ISBN: 978-3-540-31862-0
eBook Packages: Computer ScienceComputer Science (R0)