License
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CONCUR.2016.27
URN: urn:nbn:de:0030-drops-61775
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6177/
Go to the corresponding LIPIcs Volume Portal


Akshay, S. ; Gastin, Paul ; Krishna, Shankara Narayanan

Analyzing Timed Systems Using Tree Automata

pdf-format:
LIPIcs-CONCUR-2016-27.pdf (0.9 MB)


Abstract

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).

BibTeX - Entry

@InProceedings{akshay_et_al:LIPIcs:2016:6177,
  author =	{S. Akshay and Paul Gastin and Shankara Narayanan Krishna},
  title =	{{Analyzing Timed Systems Using Tree Automata}},
  booktitle =	{27th International Conference on Concurrency Theory (CONCUR 2016)},
  pages =	{27:1--27:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-017-0},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{59},
  editor =	{Jos{\'e}e Desharnais and Radha Jagadeesan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6177},
  URN =		{urn:nbn:de:0030-drops-61775},
  doi =		{10.4230/LIPIcs.CONCUR.2016.27},
  annote =	{Keywords: Timed automata, tree automata, pushdown systems, tree-width}
}

Keywords: Timed automata, tree automata, pushdown systems, tree-width
Seminar: 27th International Conference on Concurrency Theory (CONCUR 2016)
Issue Date: 2016
Date of publication: 16.08.2016


DROPS-Home | Imprint | Privacy Published by LZI