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...

Full description

Bibliographic Details

Published in:	2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science pp. 738 - 749
Main Authors:	Clemente, Lorenzo, Lasota, Slawomir
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.07.2015
Subjects:	Atomic clocks Automata Complexity theory Handheld computers orbit-finite Orbits pushdown automata Registers sets with atoms timed automata
ISSN:	1043-6871
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!