Top

Published in:

2017 | OriginalPaper | Chapter

Nested Timed Automata with Diagonal Constraints

Authors : Yuwei Wang, Yunqing Wen, Guoqiang Li, Shoji Yuen

Published in: Formal Methods and Software Engineering

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config

AI-assisted search

Off

Abstract

Time constraints are usually used in timed systems to rule on discrete behaviours based on the valuations of clocks. They are categorized into diagonal-free constraints and diagonal constraints. In timed automata, it is well-known that diagonal constraints are just a useful syntax sugar since each diagonal constraint can be encoded into diagonal-free constraints. However, it is yet unknown when recursion is taken into consideration. This paper investigates the decidability results of these systems with diagonal constraints, under the model of nested timed automata (NeTAs). We show that the NeTAs containing a singleton global clock with diagonal constraints are Turing complete, even when the clock assignment is restricted to the clock reset. In comparison, the reachability problem for a subclass, NeTAs without frozen clocks, is decidable under diagonal constraints.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

previous chapter Improving Probability Estimation Through Active Probabilistic Model Learning

next chapter Integration of Metamorphic Testing with Program Repair Methods Based on Adaptive Search Strategies and Program Equivalence

Mattai, J.: Real-Time Systems: Specification, Verification, and Analysis. Prentice Hall, Englewood Cliffs (1995)

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

Henzinger, T.A., Nicollin, X., Sifakis, J., Yovine, S.: Symbolic model checking for real-time systems. Inf. Comput. 111, 193–244 (1994)MathSciNetCrossRefMATH

Bengtsson, J., Yi, W.: Timed automata: semantics, algorithms and tools. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) ACPN 2003. LNCS, vol. 3098, pp. 87–124. Springer, Heidelberg (2004). doi:10.1007/978-3-540-27755-2_3 CrossRef

Clemente, L., Lasota, S.: Timed pushdown automata, revisited. In: Proceedings of LICS 2015, pp. 738–749

Li, G., Cai, X., Ogawa, M., Yuen, S.: Nested timed automata. In: Braberman, V., Fribourg, L. (eds.) FORMATS 2013. LNCS, vol. 8053, pp. 168–182. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40229-6_12 CrossRef

Li, G., Ogawa, M., Yuen, S.: Nested timed automata with frozen clocks. In: Sankaranarayanan, S., Vicario, E. (eds.) FORMATS 2015. LNCS, vol. 9268, pp. 189–205. Springer, Cham (2015). doi:10.1007/978-3-319-22975-1_13 CrossRef

Fang, B., Li, G., Sun, D., Cai, H.: Schedulability analysis of timed regular tasks by under-approximation on WCET. In: Fränzle, M., Kapur, D., Zhan, N. (eds.) SETTA 2016. LNCS, vol. 9984, pp. 147–162. Springer, Cham (2016). doi:10.1007/978-3-319-47677-3_10 CrossRef

Berard, B., Haddad, S., Sassolas, M.: Real time properties for interrupt timed automata. In: Proceedings of TIME 2010, pp. 69–76. IEEE Computer Society (2010)

10.

Trivedi, A., Wojtczak, D.: Recursive timed automata. In: Bouajjani, A., Chin, W.-N. (eds.) ATVA 2010. LNCS, vol. 6252, pp. 306–324. Springer, Heidelberg (2010). doi:10.1007/978-3-642-15643-4_23 CrossRef

11.

Minsky, M.: Computation: Finite and Infinite Machines. Prentice-Hall, Englewood Cliffs (1967)MATH

12.

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

13.

Abdulla, P.A., Jonsson, B.: Verifying networks of timed processes. In: Steffen, B. (ed.) TACAS 1998. LNCS, vol. 1384, pp. 298–312. Springer, Heidelberg (1998). doi:10.1007/BFb0054179 CrossRef

14.

Abdulla, P., Jonsson, B.: Model checking of systems with many identical time processes. Theoret. Comput. Sci. 290, 241–264 (2003)MathSciNetCrossRefMATH

15.

Cai, X., Ogawa, M.: Well-structured pushdown system: case of dense timed pushdown automata. In: Codish, M., Sumii, E. (eds.) FLOPS 2014. LNCS, vol. 8475, pp. 336–352. Springer, Cham (2014). doi:10.1007/978-3-319-07151-0_21 CrossRef

16.

Abdulla, P.A., Atig, M.F., Stenman, J.: Dense-timed pushdown automata. In: Proceedings of LICS 2012, pp. 35–44. IEEE Computer Society (2012)

17.

Abdulla, P.A., Atig, M.F., Stenman, J.: The minimal cost reachability problem in priced timed pushdown systems. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 58–69. Springer, Heidelberg (2012). doi:10.1007/978-3-642-28332-1_6 CrossRef

18.

Alur, R., Etessami, K., Yannakakis, M.: Analysis of recursive state machines. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 207–220. Springer, Heidelberg (2001). doi:10.1007/3-540-44585-4_18 CrossRef

19.

Benerecetti, M., Minopoli, S., Peron, A.: Analysis of timed recursive state machines, pp. 61–68. In: Proceedings of the TIME 2010. IEEE Computer Society (2010)

20.

Wang, Y., Li, G., Yuen, S.: Nested timed automata with various clocks. Sci. Found. Chin. 24, 51–68 (2016)

21.

Tian, C., Duan, Z.: Detecting spurious counterexamples efficiently in abstract model checking. In: Proceedings of the ICSE 2013, pp. 202–211. IEEE/ACM (2013)

22.

Tian, C., Duan, Z., Duan, Z.: Making CEGAR more efficient in software model checking. IEEE Trans. Softw. Eng. 40, 1206–1223 (2014)CrossRef

23.

Liu, Y., Duan, Z., Tian, C.: A decision procedure for a fragment of linear time Mu-calculus. In: Proceedings of the IJCAI 2016, pp. 1195–1201. IJCAI/AAAI Press (2016)

Title: Nested Timed Automata with Diagonal Constraints
Authors: Yuwei Wang
Yunqing Wen
Guoqiang Li
Shoji Yuen
Publisher: Springer International Publishing
Book: Formal Methods and Software Engineering
Print ISBN: 978-3-319-68689-9

Electronic ISBN: 978-3-319-68690-5

Copyright Year: 2017
DOI: https://doi.org/10.1007/978-3-319-68690-5_24

Springer Professional

Abstract

Please log in to get access to your license.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Technik"

Springer Professional "Wirtschaft"

Premium Partner