Verification for Timed Automata Extended with Unbounded Discrete Data Structures

  title={Verification for Timed Automata Extended with Unbounded Discrete Data Structures},
  author={Karin Quaas},
  • Karin Quaas
  • Published in CONCUR 25 March 2014
  • Computer Science
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… 
4 Citations

Figures from this paper

Reachability relations of timed pushdown automata

Decidability of Timed Communicating Automata

This work provides a complete characterisation of decidable and undecidable communication topologies generalising and unifying previous work on the reachability problem for networks of timed communicating processes.

Timed Basic Parallel Processes

It is shown that the reachability relation of 1-clock TA can be expressed by a formula of polynomial size in the existential fragment of linear arithmetic, which improves on recent results from the literature.

Symbolic Monitoring against Specifications Parametric in Time and Data

This work proposes an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains that is able to output answers symbolic in these parameters and in the log segments where the property is satisfied or violated.



Decision Problems for the Verification of Real-Time Software

It is shown that if the specification B is modeled as a timed automaton with one clock, then the language inclusion problem L(A)⊆L(B) for a timed pushdown automaton A is decidable and the universality problem of timed visibly push down automata with only one clock is undecidable.

Decision Problems for Timed Automata: A Survey

A survey of the theoretical results concerning decision problems of reachability, language inclusion and language equivalence for timed automata and its variants, with some new proofs and comparisons is provided.

Alternating timed automata

It is shown that such automata with only one clock have decidable emptiness problem over finite words and undecidability of the universality problem is shown over infinite words.

Pushdown timed automata: a binary reachability characterization and safety verification

  • Z. Dang
  • Computer Science
    Theor. Comput. Sci.
  • 2003

Model Checking Metric Temporal Logic over Automata with One Counter

This work studies the decidability status of the model checking problem for Metric Temporal Logic over models with one counter variable whose value can increase and decrease, and shows that model checking of deterministic models is decidable.

Model checking of systems with many identical timed processes

On the language inclusion problem for timed automata: closing a decidability gap

  • J. OuaknineJ. Worrell
  • Computer Science, Mathematics
    Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.
  • 2004
The crux of the proof consists in reducing the language inclusion problem to a reachability question on an infinite graph, and constructing a suitable well-quasi-order on the nodes of this graph, which ensures the termination of the search algorithm.

On the Interval-Bound Problem for Weighted Timed Automata

A weighted timed automaton is a timed automaton equipped with weights on transitions and weight rates on locations. These weights may be positive or negative, corresponding to the production and

Reachability in Timed Counter Systems

On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures

This work addresses the verification problem of invariance properties for hybrid systems by presenting decidability results for several subclasses of such models of hybrid systems, supplied with (unbounded) discrete data structures and continuous variables.