Quaas, Karin - Verification for Timed Automata extended with Unbounded Discrete Data Structures

lmcs:1596 - Logical Methods in Computer Science, September 22, 2015, Volume 11, Issue 3
Verification for Timed Automata extended with Unbounded Discrete Data Structures

Authors: Quaas, Karin

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata with a pushdown stack. In this way, we obtain a strong model that may for instance be used to model real-time programs with procedure calls. It is long known that the reachability problem for this model is decidable. The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable.


Source : oai:arXiv.org:1403.6303
DOI : 10.2168/LMCS-11(3:20)2015
Volume: Volume 11, Issue 3
Published on: September 22, 2015
Submitted on: July 1, 2014
Keywords: Computer Science - Logic in Computer Science


Share

Consultation statistics

This page has been seen 77 times.
This article's PDF has been downloaded 46 times.