We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown stack. A configuration of a ...

Abstract. We introduce discrete pushdown timed automata that are timed automata with integer-valued clocks augmented with a pushdown.

Contents. CAV '00: Proceedings of the 12th International Conference on Computer Aided Verification. Binary Reachability Analysis of Discrete Pushdown Timed ...

The binary reachability of a discrete timed automaton can be accepted by a nondeterministic reversal-bounded multicounter machine and the results can be ...

Binary reachability analysis of discrete pushdown timed automata. CAV'00, Lecture Notes in Computer Science, Vol. 1855, Springer, Berlin (2000), pp. 69-84.

Jul 4, 2001 · A configuration of a PTA includes a control state, dense clock values and a stack word. By using the pattern technique, we give a decidable ...

The results can be used to verify a class of properties containing linear relations over both dense variables and unbounded discrete variables. The properties ...

We consider pushdown timed automata (PTAs) that are timed automata (with dense clocks) augmented with a pushdown stack. A configuration of a PTA includes a ...

We study an expressive model of timed pushdown automata extended with modular and fractional clock constraints. We show that the binary reachability ...

Zhe Dang, Oscar H. Ibarra, Tevfik Bultan, Richard A. Kemmerer, Jianwen Su: Binary Reachability Analysis of Discrete Pushdown Timed Automata. CAV 2000: 69-84.