Timed Pushdown Automata Revisited

DOI10.1109/LICS.2015.73zbMath1401.68157arXiv1503.02422OpenAlexW1524026935WikidataQ130981265 ScholiaQ130981265MaRDI QIDQ4635851

Lorenzo Clemente, Sławomir Lasota

Publication date: 23 April 2018

Published in: 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.02422

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (10)

Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Towards an Efficient Tree Automata based technique for Timed Systems ⋮ Dynamic data structures for timed automata acceptance ⋮ On the determinization of event-clock input-driven pushdown automata ⋮ Unnamed Item ⋮ Context-free timed formalisms: robust automata and linear temporal logics

This page was built for publication: Timed Pushdown Automata Revisited