2014/09/08 by Béatrice Bérard, Serge Haddad, Bérard, Béatrice +5
Computer Science · #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #Formal Methods in Verification #Logic in Computer Science (cs.LO) #Petri Nets in System Modeling #Security and Verification in Computing
paper · pdf · doi:10.48550/arxiv.1409.2408
openalex publication_date 2014/09/08 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Interrupt Timed Automata (ITA) is an expressive timed model, introduced to take into account interruptions, according to levels. Due to this feature, this formalism is incomparable with Timed Automata. However several decidability results related to reachability and model checking have been obtained. We add auxiliary clocks to ITA, thereby extending its expressive power while preserving decidability of reachability. Moreover, we define a parametrized version of ITA, with polynomials of parameters appearing in guards and updates. While parametric reasoning is particularly relevant for timed models, it very often leads to undecidability results. We prove that various reachability problems, including "robust" reachability, are decidable for this model, and we give complexity upper bounds for a fixed or variable number of clocks, levels and parameters.