scientific article; zbMATH DE number 6876269

DOI10.23638/LMCS-14(2:8)2018zbMath1398.68290arXiv1604.08443MaRDI QIDQ4643961

Paul Gastin, S. Akshay, Shankara Narayanan Krishna

Publication date: 30 May 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

timed automatatree automatatree-widthpushdown systems

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Revisiting Underapproximate Reachability for Multipushdown Systems, Fast zone-based algorithms for reachability in pushdown timed automata, Reachability relations of timed pushdown automata, Unnamed Item, Unnamed Item

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A theory of timed automata
• MSO Decidability of Multi-Pushdown Systems via Split-Width
• Model-Checking of Ordered Multi-Pushdown Automata
• Dense-Timed Pushdown Automata
• What's decidable about recursive hybrid automata?
• The Language Theory of Bounded Context-Switching
• Analyzing Timed Systems Using Tree Automata
• Timed Pushdown Automata Revisited
• The tree width of auxiliary storage
• Formal Methods for the Design of Real-Time Systems
• Reachability Problem for Weak Multi-Pushdown Automata
• Scope-Bounded Pushdown Languages