Updatable timed automata with one updatable clock
- 39 Downloads
Updatable timed automata (UTAs) proposed by Bouyer et.al., is an extension of timed automata (TAs) having the extra ability to update clocks in a more elaborate way than simply reset them to zero. The reachability of UTAs is generally undecidable, which can be easily gained by regarding a pair of clocks as updatable counters. This paper investigates a subclass of UTAs by restricting the number of updatable clocks to be one. We will show that (1) the reachability of general UTAs with one updatable clock (UTA1s) is still undecidable, and (2) that of UTA1s under diagonal-free constraints is decidable, and the complexity is Pspace-complete. The former is achieved by encoding Minsky machines to the general UTA1s, where two counters are simulated by the updatable clock. The latter is gained by regarding a region of a UTA1 to be an unbounded digiword, and encoding sets of digiwords that are accepted by a one counter automaton where regions are generated as the value of the counter.
Keywordsupdatable timed automata one counter automata digiword reachability problem
This work was supported by NSFC-JSPS Bilateral Joint Research Project (Grant No. 61511140100), and National Natural Science Foundation of China (Grant Nos. 61472240, 61602224, 91318301).
- 3.Bouyer P, Dufourd C, Fleury E, et al. Expressiveness of updatable timed automata. In: Proceedings of International Symposium on Mathematical Foundations of Computer, Bratislava, 2000. 232–242Google Scholar
- 5.Minsky M L. Computation: Finite and Infinite Machines. Upper Saddle River: Prentice-Hall, 1967Google Scholar
- 7.Fang B B, Li G Q, Fang L, et al. A refined algorithm for reachability analysis of updatable timed automata. In: Proceedings of IEEE International Conference on the Software Quality, Reliability and Security - Companion, Vancouver, 2015. 230–236Google Scholar
- 9.Wen Y Q, Li G Q, Yuen S. On reachability analysis of updatable timed automata with one updatable clock. In: Proceedings of International Workshop on Structured Object-Oriented Formal Language and Method, Pairs, 2015, 147–161Google Scholar
- 10.Abdulla P A, Atig M F, Stenman J. Dense-timed pushdown automata. In: Proceedings of 27th Annual IEEE Symposium on Logic in Computer Science, Dubrovnik, 2012. 35–44Google Scholar
- 13.Haase C, Kreutzer S, Ouaknine J, et al. Reachability in succinct and parametric one-counter automata. In: Proceedings of the International Conference on Concurrency Theory, Bologna, 2009. 369–383Google Scholar
- 14.Schwoon S. Model-checking pushdown system. Dissertation for Ph.D. Degree. Munich: Technical University of Munich, 2000Google Scholar
- 17.Ouaknine J, Worrell J. On the language inclusion problem for timed automata: closing a decidability gap. In: Proceedings of the 19th IEEE Symposium on Logic in Computer Science, Turku, 2004. 54–63Google Scholar
- 22.Demichelis F, Zielonka W. Controlled timed automata. In: Proceedings of the 9th International Conference on Concurrency Theory, Nice, 1998. 455–469Google Scholar
- 30.Wen Y Q, Li G Q, Yuen S J. An over-approximation forward analysis for nested timed automata. In: Proceedings of International Workshop on Structured Object-Oriented Formal Language and Method, Luxembourg, 2014. 62–80Google Scholar