Verification for Timed Automata Extended with Unbounded Discrete Data Structures

@inproceedings{Quaas2014VerificationFT,
  title={Verification for Timed Automata Extended with Unbounded Discrete Data Structures},
  author={Karin Quaas},
  booktitle={CONCUR},
  year={2014}
}
  • 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
Timed Basic Parallel Processes
TLDR
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
TLDR
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.
Decidability of Timed Communicating Automata
TLDR
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.

References

SHOWING 1-10 OF 51 REFERENCES
Decision Problems for the Verification of Real-Time Software
TLDR
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
TLDR
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
TLDR
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.
Model Checking Metric Temporal Logic over Automata with One Counter
TLDR
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.
On the Automatic Verification of Systems with Continuous Variables and Unbounded Discrete Data Structures
TLDR
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.
Undecidability of Universality for Timed Automata with Minimal Resources
TLDR
This paper studies the decidability of universality for classes of timed automata with minimal resources, and considers restrictions on the number of states and clock constants, as well as the size of the event alphabet.
MTL-Model Checking of One-Clock Parametric Timed Automata is Undecidable
TLDR
It is proved that MTL-model checking for parametric timed automata is undecidable, even if the automaton uses only one clock and one parameter and is deterministic.
On the decidability of metric temporal logic
  • J. Ouaknine, J. Worrell
  • Computer Science
    20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05)
  • 2005
TLDR
It is shown that the satisfiability problem for MTL over finite timed words is decidable, with non-primitive recursive complexity, and that model checking the safety fragment of MTL-which includes invariance and time-bounded response properties-is also decidable.
...
...