Dense-timed pushdown automata

DOI10.1109/LICS.2012.15MaRDI QIDQ2986779zbMATH OpenOpenAlexFDO

Authors Mohamed Faouzi Atig, Jari Stenman, Parosh A. 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)

Recommendations

• A logical characterization of timed pushdown languages
• Timed Pushdown Automata Revisited
• Zenoness for timed pushdown automata
• Reachability relations of timed pushdown automata
• Computing optimal reachability costs in priced dense-timed pushdown automata

Cited in

(27)

• Adding dense-timed stack to integer reset timed automata
• Analyzing pushdown systems with stack manipulation
• On the determinization of event-clock input-driven pushdown automata
• Context-free timed formalisms: robust automata and linear temporal logics
• Reachability relations of timed pushdown automata
• Timed recursive state machines: expressiveness and complexity
• A logical characterization for dense-time visibly pushdown automata
• A perfect class of context-sensitive timed languages
• Nested timed automata with frozen clocks
• Tinput-Driven Pushdown Automata
• Logics for weighted timed pushdown automata
• A logical characterization of timed pushdown languages
• Timed context-free temporal logics
• Synchronized recursive timed automata
• scientific article; zbMATH DE number 1796157 (Why is no real title available?)
• Timed Pushdown Automata Revisited
• Analyzing timed systems using tree automata
• Zenoness for timed pushdown automata
• Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms
• Verifying quantitative temporal properties of procedural programs
• Revisiting underapproximate reachability for multipushdown systems
• Towards an Efficient Tree Automata based technique for Timed Systems
• Visibly pushdown modular games
• Well-structured pushdown system: case of dense timed pushdown automata
• Computing optimal reachability costs in priced dense-timed pushdown automata
• Timed Basic Parallel Processes
• Fast zone-based algorithms for reachability in pushdown timed automata

This page was built for publication: Dense-timed pushdown automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2986779)