Abstract. We consider past pushdown timed automata that are discrete push- down timed automata [15] with past-formulas as enabling conditions. Using past.

We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a ...

Dec 18, 2002 · We consider past pushdown timed automata that are discrete pushdown timed automata [15] with past-formulas as enabling conditions.

Jan 27, 2003 · Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove ...

Using past formulas allows a past pushdown timed automaton to access the past values of the finite state variables in the automaton. We prove that the ...

Feb 16, 2004 · We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions.

We consider past pushdown timed automata that are discrete pushdown timed automata [15] with past-formulas as enabling conditions. Using past formulas ...

Abstract—This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of ...

We propose a model that captures the behavior of real-time recursive systems. To that end, we introduce dense-timed pushdown automata that extend the classical.

We consider past pushdown timed automata that are discrete pushdown timed automata with past formulas as enabling conditions. Using past formulas allows a ...