Analyzing Timed Systems Using Tree Automata - Archive ouverte HAL Access content directly
Conference Papers Year : 2016

Analyzing Timed Systems Using Tree Automata


Timed systems, such as timed automata, are usually analyzed using their operational semantics on timed words. The classical region abstraction for timed automata reduces them to (untimed) finite state automata with the same time-abstract properties, such as state reachability. We propose a new technique to analyze such timed systems using finite tree automata instead of finite word automata. The main idea is to consider timed behaviors as graphs with matching edges capturing timing constraints. Such graphs can be interpreted in trees opening the way to tree automata based techniques which are more powerful than analysis based on word automata. The technique is quite general and applies to many timed systems. In this paper, as an example, we develop the technique on timed pushdown systems, which have recently received considerable attention. Further, we also demonstrate how we can use it on timed automata and timed multi- stack pushdown systems (with boundedness restrictions).
Fichier principal
Vignette du fichier
AGS-concur16.pdf (919.49 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01407942 , version 1 (02-12-2016)



Sunil Akshay, Paul Gastin, Shankara Narayanan Krishna. Analyzing Timed Systems Using Tree Automata. 27th International Conference on Concurrency Theory (CONCUR 2016), 2016, Québec City, Canada. pp.27:1-27:14, ⟨10.4230/LIPIcs.CONCUR.2016.27⟩. ⟨hal-01407942⟩
95 View
31 Download



Gmail Mastodon Facebook X LinkedIn More