Timed Pushdown Automata Revisited

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 Abdulla et al. Collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of fir...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science s. 738 - 749
Hlavní autoři: Clemente, Lorenzo, Lasota, Slawomir
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2015
Témata:
Atomic clocks
Automata
Complexity theory
Handheld computers
orbit-finite
Orbits
pushdown automata
Registers
sets with atoms
timed automata
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 Abdulla et al. Collapses: it is expressively equivalent to dense-timed PDA with timeless stack. Motivated by this result, we advocate the framework of first-order definable PDA, a specialization of PDA in sets with atoms, as the right setting to define and investigate timed extensions of PDA. The general model obtained in this way is Turing complete. As our second result we prove NEXPTIME upper complexity bound for the non-emptiness problem for an expressive subclass. As a byproduct, we obtain a tight EXPTIME complexity bound for a more restrictive subclass of PDA with timeless stack, thus subsuming the complexity bound known for dense-timed PDA.
ISSN:1043-6871
DOI:10.1109/LICS.2015.73