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


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

Towards an Efficient Tree Automata Based Technique for Timed Systems

pdf-format:
LIPIcs-CONCUR-2017-39.pdf (0.9 MB)


Abstract

The focus of this paper is the analysis of real-time systems with recursion, through the development of good theoretical techniques which are implementable. Time is modeled using clock variables, and recursion using stacks. Our technique consists of modeling the behaviours of the timed system as graphs, and interpreting these graphs on tree terms by showing a bound on their tree-width. We then build a tree automaton that accepts exactly those tree terms that describe realizable runs of the timed system. The emptiness of the timed system thus boils down to emptiness of a finite tree automaton that accepts these tree terms. This approach helps us in obtaining an optimal complexity, not just in theory (as done in earlier work e.g.[concur16]), but also in going towards an efficient implementation of our technique. To do this, we make several improvements in the theory and exploit these to build a first prototype tool that can analyze timed systems with recursion.

BibTeX - Entry

@InProceedings{akshay_et_al:LIPIcs:2017:7801,
  author =	{S. Akshay and Paul Gastin and Shankara Narayanan Krishna and Ilias Sarkar},
  title =	{{Towards an Efficient Tree Automata Based Technique for Timed Systems}},
  booktitle =	{28th International Conference on Concurrency Theory (CONCUR 2017)},
  pages =	{39:1--39:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-048-4},
  ISSN =	{1868-8969},
  year =	{2017},
  volume =	{85},
  editor =	{Roland Meyer and Uwe Nestmann},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7801},
  URN =		{urn:nbn:de:0030-drops-78017},
  doi =		{10.4230/LIPIcs.CONCUR.2017.39},
  annote =	{Keywords: Timed automata, tree automata, pushdown systems, tree-width}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI