Towards an Efficient Tree Automata based technique for Timed Systems

DOI10.4230/LIPIcs.CONCUR.2017.39zbMath1442.68123arXiv1707.02297OpenAlexW2962796379MaRDI QIDQ5111654

Shankara Narayanan Krishna, S. Akshay, Ilias Sarkar, Paul Gastin

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1707.02297

zbMATH Keywords

timed automatatree automatatree-widthpushdown systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (4)

Revisiting Underapproximate Reachability for Multipushdown Systems ⋮ Fast zone-based algorithms for reachability in pushdown timed automata ⋮ Bounded Context Switching for Valence Systems ⋮ Towards an Efficient Tree Automata based technique for Timed Systems

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• A theory of timed automata
• Nested Timed Automata
• The Minimal Cost Reachability Problem in Priced Timed Pushdown Systems
• MSO Decidability of Multi-Pushdown Systems via Split-Width
• Dense-Timed Pushdown Automata
• Analyzing Timed Systems Using Tree Automata
• Timed Pushdown Automata Revisited
• Recursive Timed Automata
• Towards an Efficient Tree Automata based technique for Timed Systems
• The tree width of auxiliary storage
• Formal Methods for the Design of Real-Time Systems

This page was built for publication: Towards an Efficient Tree Automata based technique for Timed Systems