Name
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. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1007/s00224-010-9253-z | Theory Comput. Syst. |
Keywords | Field | DocType |
Weighted timed automata,Weighted CTL,Model checking,Integer resets,Clock reduction | Integer,Discrete mathematics,Combinatorics,Model checking,Automaton,Decidability,Timed automaton,Stopwatch,Formalism (philosophy),Mathematics,Undecidable problem | Journal |
Volume | Issue | ISSN |
48 | 3 | 1432-4350 |
Citations | PageRank | References |
1 | 0.34 | 24 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lakshmi Manasa | 1 | 30 | 5.03 |
| Shankara Narayanan Krishna | 2 | 243 | 42.57 |
| Chinmay Jain | 3 | 4 | 1.13 |