Dense-Timed Pushdown Automata

DOI10.1109/LICS.2012.15zbMath1360.68535OpenAlexW1976426006MaRDI QIDQ2986779

Mohamed Faouzi Atig, Jari Stenman, Parosh Aziz Abdulla

Publication date: 16 May 2017

Published in: 2012 27th Annual IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/lics.2012.15

zbMATH Keywords

automataformal verification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (18)

Timed recursive state machines: expressiveness and complexity ⋮ Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Fast zone-based algorithms for reachability in pushdown timed automata ⋮ A Logical Characterization of Timed Pushdown Languages ⋮ Nested Timed Automata with Frozen Clocks ⋮ Logics for Weighted Timed Pushdown Automata ⋮ Unnamed Item ⋮ Analyzing pushdown systems with stack manipulation ⋮ Unnamed Item ⋮ Reachability relations of timed pushdown automata ⋮ Timed Basic Parallel Processes ⋮ Verifying quantitative temporal properties of procedural programs ⋮ Visibly pushdown modular games ⋮ A Perfect Class of Context-Sensitive Timed Languages ⋮ Towards an Efficient Tree Automata based technique for Timed Systems ⋮ 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: Dense-Timed Pushdown Automata