Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata

DOI10.1016/J.IPL.2021.106231MaRDI QIDQ2059913zbMATH OpenOpenAlexFDO

Authors 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.106231

zbMATH Keywords

computational complexityexistential theory of realslower boundreachability

Mathematics Subject Classification ID

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

Recommendations

• Revisiting reachability in polynomial interrupt timed automata
• Polynomial interrupt timed automata: verification and expressiveness
• Corrigendum to ``Reachability-based acyclicity analysis by abstract interpretation
• Corrections to “A Menagerie of Timed Automata”
• Correction
• Interrupt timed automata: verification and expressiveness
• scientific article; zbMATH DE number 7297846
• Corrigendum to: ``Iterated stack automata and complexity classes
• Polynomial interrupt timed automata

Cited in

(1)

• Corrections to “A Menagerie of Timed Automata”

This page was built for publication: Corrigendum to: ``Revisiting reachability in polynomial interrupt timed automata

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