Skip to main content
Log in

Model Checking Weighted Integer Reset Timed Automata

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

Weighted timed automata (WTA), introduced in Alur et al. (Proceedings of HSCC’01, LNCS, vol. 2034, pp. 49–62, Springer, Berlin, 2001), Behrmann et al. (Proceedings of HSCC’01, LNCS, vol. 2034, pp. 147–161, Springer, Berlin, 2001) are an extension of Alur and Dill (Theor. Comput. Sci. 126(2):183–235, 1994) timed automata, a widely accepted formalism for the modelling and verification of real time systems. Weighted timed automata extend timed automata by allowing costs on the locations and edges. There has been a lot of interest Bouyer et al. (Inf. Process. Lett. 98(5):188–194, 2006), Bouyer et al. (Log. Methods Comput. Sci. 4(2):9, 2008), Brihaye et al. (Proceedings of FORMATS/FTRTFT’04, LNCS, vol. 3253, pp. 277–292, Springer, Berlin, 2004), Brihaye et al. (Inf. Comput. 204(3):408–433, 2006) in studying the model checking problem of weighted timed automata. The properties of interest are written using logic weighted CTL (WCTL), an extension of CTL with costs. It has been shown Bouyer et al. (Log. Methods Comput. Sci. 4(2):9, 2008) that the problem of model checking WTAs with a single clock using WCTL with no external cost variables is decidable, while 3 clocks render the problem undecidable Bouyer et al. (Inf. Process. Lett. 98(5):188–194, 2006). The question of 2 clocks is open. In this paper, we introduce a subclass of weighted timed automata called weighted integer reset timed automata (WIRTA) and study the model checking problem. We give a clock reduction technique for WIRTA. Given a WIRTA \(\mathcal{A}\) with n≥1 clocks, we show that a single clock WIRTA \(\mathcal{A}'\) preserving the paths and costs of \(\mathcal{A}\) can be obtained. This gives us the decidability of model checking WIRTA with n≥1 clocks and m≥1 costs using WCTL with no external cost variables. We then show that for a restricted version of WCTL with external cost variables, the model checking problem is undecidable for WIRTA with 3 stopwatch costs and 1 clock. Finally, we show that model checking WTA with 2 clocks and 1 stopwatch cost against WCTL with no external cost variables is undecidable, thereby answering a question that has remained long open.

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.

Similar content being viewed by others

References

  1. Alur, R., Dill, D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183–235 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  2. Alur, R., Courcoubetis, C., Dill, D.L.: Model-checking in dense real time. Inf. Comput. 104(1), 2–34 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  3. Alur, R., Henzinger, T.A., Ho, P.-H.: Automatic symbolic verification of embedded systems. IEEE Trans. Softw. Eng. 22(3), 181–201 (1996)

    Article  Google Scholar 

  4. Alur, R., Fix, L., Henzinger, T.: Event-clock automata, a determinizable class of timed automata. Theor. Comput. Sci. 211, 253–273 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  5. Alur, R., La Torre, S., Pappas, G.: Optimal paths in weighted timed automata. In: Proceedings of HSCC’01. LNCS, vol. 2034, pp. 49–62. Springer, Berlin (2001)

    Google Scholar 

  6. Alur, R., La Torre, S., Madhusudan, P.: Perturbed timed automata. In: Proceedings of HSCC’05. LNCS, vol. 3414, pp. 70–85. Springer, Berlin (2005)

    Google Scholar 

  7. Baier, C., Bertrand, N., Bouyer, P., Brihaye, T.: When are timed automata determinizable? In: Proceedings of ICALP’09(2). LNCS, vol. 5556, pp. 43–54. Springer, Berlin (2009)

    Google Scholar 

  8. Behrmann, G., David, A., Larsen, K.G., Möller, O., Pettersson, P., Yi, W.: Uppaal—present and future. In: Proceedings of the 40th IEEE Conference on Decision and Control’01. IEEE Computer Society Press, Los Alamitos (2001)

    Google Scholar 

  9. Behrmann, G., Fehnkar, A., Hune, T., Larsen, K.G., Petterson, P., Romijn, J., Vaandrager, F.: Minimum-cost reachability for priced timed automata. In: Proceedings of HSCC’01. LNCS, vol. 2034, pp. 147–161. Springer, Berlin (2001)

    Google Scholar 

  10. Bérard, B., Duford, C.: Timed automata and additive clock constraints. Inf. Process. Lett. 75(1–2), 1–7 (2000)

    Article  MATH  Google Scholar 

  11. Bérard, B., Gastin, P., Petit, A.: On the power of non observable actions in timed automata. In: Proceedings of STACS’96. LNCS, vol. 1046, pp. 257–268. Springer, Berlin (1996)

    Google Scholar 

  12. Bouyer, P., Duford, C., Fleury, E., Petit, A.: Updatable timed automata. Theor. Comput. Sci. 321(2–3), 291–345 (2004)

    Article  MATH  Google Scholar 

  13. Bouyer, P., Chevalier, F., Markey, N.: On the expressiveness of TPTL and MTL. In: Proceedings of FST&TCS’05. LNCS, vol. 3821, pp. 432–443. Springer, Berlin (2005)

    Google Scholar 

  14. Bouyer, P., Brihaye, T., Markey, N.: Improved undecidability results on weighted timed automata. Inf. Process. Lett. 98(5), 188–194 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  15. Bouyer, P., Larsen, K.G., Markey, N.: Model checking one-clock priced timed automata, Log. Methods Comput. Sci. 4(2), 9 (2008)

    MathSciNet  Google Scholar 

  16. Brihaye, T., Bruyère, V., Raskin, J.: Model-checking for weighted timed automata. In: Proceedings of FORMATS/FTRTFT’04. LNCS, vol. 3253, pp. 277–292. Springer, Berlin (2004)

    Google Scholar 

  17. Brihaye, T., Bruyère, V., Raskin, J.: On model-checking timed automata with stopwatch observers. Inf. Comput. 204(3), 408–433 (2006)

    Article  MATH  Google Scholar 

  18. Choffrut, C., Goldwur, M.: Timed automata with periodic clock constraints. J. Autom. Lang. Comb. 5(4), 371–404 (2000)

    MATH  MathSciNet  Google Scholar 

  19. Daws, C., Olivero, A., Tripakis, S., Yovine, S.: The tool KRONOS. In: Proceedings of Hybrid Systems’95. LNCS, vol. 1066, pp. 208–219. Springer, Berlin (1995)

    Chapter  Google Scholar 

  20. Demichelis, F., Zielonka, W.: Controlled timed automata. In: Proceedings of CONCUR’98. LNCS, vol. 1466, pp. 455–469. Springer, Berlin (1998)

    Google Scholar 

  21. Henzinger, T., Manna, Z., Pnueli, A.: What good are digital clocks? In: Proceedings of ICALP’92. LNCS, vol. 623, pp. 545–558. Springer, Berlin (1992)

    Google Scholar 

  22. Manasa, L., Krishna, S.N.: Integer reset timed automata—clock reduction and determinizability. CoRR/abs/1001.1215 (2010). Available at http://arxiv.org/abs/1001.1215v1/

  23. Manasa, L., Krishna, S.N., Nagaraj, K.: Updatable timed automata with additive and diagonal constraints. In: Proceedings of CiE’08. LNCS, vol. 5028, pp. 407–416. Springer, Berlin (2008)

    Google Scholar 

  24. Minsky, M.L.: Computation: Finite and Infinite Machines. Prentice-Hall, New York (1967)

    MATH  Google Scholar 

  25. Nagaraj, K.: Topics in timed automata. Master’s Thesis. Department of Computer Science & Engineering, Indian Institute of Technology, Bombay, July 2006

  26. Ouaknine, J., Worrell, J.: On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of LICS’04, pp. 54–63. IEEE Computer Society, Los Alamitos (2004)

    Google Scholar 

  27. Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed automata with integer resets: language inclusion and expressiveness. In: Proceedings of FORMATS’08. LNCS, vol. 5215, pp. 78–92. Springer, Berlin (2008)

    Google Scholar 

  28. Suman, P.V., Pandya, P.K., Krishna, S.N., Manasa, L.: Timed automata with integer resets: language inclusion and expressiveness. Research report TIFR-SPKG-GM-2008/1, Tata Institute of Fundamental Research, Bombay 2008. Available at http://www.tcs.tifr.res.in/~vsuman/TechReps/IrtaLangInclTechRep.pdf

  29. Suman, P.V., Pandya, P.K.: Determinization and expressiveness of integer reset timed automata with silent transitions. In: Proceedings of LATA’09. LNCS, vol. 5457, pp. 728–739. Springer, Berlin (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lakshmi Manasa.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Manasa, L., Krishna, S.N. & Jain, C. Model Checking Weighted Integer Reset Timed Automata. Theory Comput Syst 48, 648–679 (2011). https://doi.org/10.1007/s00224-010-9253-z

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-010-9253-z

Keywords

Navigation