Revisiting reachability in polynomial interrupt timed automata

DOI10.1016/j.ipl.2021.106208zbMath1483.68157OpenAlexW3202559201MaRDI QIDQ2059890

Béatrice Bérard, Serge Haddad

Publication date: 14 December 2021

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2021.106208

zbMATH Keywords

complexityreal-time systemsreachability problemsinterrupt timed automata

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Cites Work

• Interrupt timed automata: verification and expressiveness
• What's decidable about hybrid automata?
• A theory of timed automata
• Polynomial interrupt timed automata
• Polynomial interrupt timed automata: verification and expressiveness
• Interrupt Timed Automata with Auxiliary Clocks and Parameters*
• Interrupt Timed Automata
• Parametric Interrupt Timed Automata
• Algorithms in real algebraic geometry
• Unnamed Item
• Unnamed Item