Mar 25, 2014 · Abstract: We study decidability of verification problems for timed automata extended with unbounded discrete data structures.

Sep 22, 2015 · Abstract. We study decidability of verification problems for timed automata extended with unbounded discrete data structures.

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata ...

Abstract: We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed ...

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata ...

The goal of this paper is to identify subclasses of timed pushdown automata for which the language inclusion problem and related problems are decidable and ...

We study decidability of verification problems for timed au- tomata extended with unbounded discrete data structures. More de- tailed, we extend timed automata ...

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata ...

Karin Quaas: Verification for Timed Automata extended with Discrete Data Structure. Log. Methods Comput. Sci. 11(3) (2015). manage site settings.

We study decidability of verification problems for timed automata extended with unbounded discrete data structures. More detailed, we extend timed automata ...