Analyzing Timed Systems Using Tree Automata

DOI10.4230/LIPICS.CONCUR.2016.27MaRDI QIDQ4608679zbMATH OpenOpenAlexFDO

Authors S. Akshay, Paul Gastin, Shankara Narayanan Krishna

Publication date 21 March 2018

Full work available at URL https://hal.archives-ouvertes.fr/hal-01407942

zbMATH Keywords

pushdown systemstimed automatatree automatatree-width

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Analyzing timed systems using tree automata
• Towards an Efficient Tree Automata based technique for Timed Systems
• Timed tree automata with an application to temporal logic.
• scientific article; zbMATH DE number 1405651
• A theory of timed automata
• Lectures on Concurrency and Petri Nets
• scientific article; zbMATH DE number 1543316
• Branching-time temporal logic and tree automata
• Timed automata robustness analysis via model checking
• scientific article; zbMATH DE number 2102690

Cited in

(11)

• On exteriority notions in book embeddings and treewidth
• Analysis of scheduling behaviour using generic timed automata
• A model of finite automata on timed omega-trees
• Exact Incremental Analysis of Timed Automata with an SMT-Solver
• Analyzing timed systems using tree automata
• scientific article; zbMATH DE number 744061 (Why is no real title available?)
• scientific article; zbMATH DE number 1405651 (Why is no real title available?)
• Bounded context switching for valence systems
• Verifying quantitative temporal properties of procedural programs
• Data multi-pushdown automata
• Towards an Efficient Tree Automata based technique for Timed Systems

This page was built for publication: Analyzing Timed Systems Using Tree Automata

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