Analyzing Timed Systems Using Tree Automata

DOI10.4230/LIPIcs.CONCUR.2016.27zbMath1392.68212OpenAlexW2963919909MaRDI QIDQ4608679

Shankara Narayanan Krishna, Paul Gastin, S. Akshay

Publication date: 21 March 2018

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

zbMATH Keywords

timed automatatree automatatree-widthpushdown systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (6)

Bounded Context Switching for Valence Systems ⋮ Verifying quantitative temporal properties of procedural programs ⋮ On exteriority notions in book embeddings and treewidth ⋮ Data Multi-Pushdown Automata ⋮ Towards an Efficient Tree Automata based technique for Timed Systems ⋮ Unnamed Item

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