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)

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

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)