Polynomial interrupt timed automata: Verification and expressiveness - Sorbonne Université Access content directly
Journal Articles Information and Computation Year : 2021

Polynomial interrupt timed automata: Verification and expressiveness


Interrupt Timed Automata (ITA ) form a subclass of stopwatch automata where reachability and some variants of timed model checking are decidable even in presence of parameters. They are well suited to model and analyze real-time operating systems. Here we extend ITA with polynomial guards and updates, leading to the class of polynomial ITA (PolITA ). We prove that reachability is decidable in 2EXPTIME on PolITA, using an adaptation of the cylindrical algebraic decomposition algorithm for the first-order theory of reals. We also obtain decidability for the model checking of a timed version of CTL and for reachability in several extensions of PolITA. In particular, compared to previous approaches, our procedure handles parameters and clocks in a unified way. We also study expressiveness questions for PolITA and show that PolITA are incomparable with stopwatch automata.
Fichier principal
Vignette du fichier
S0890540120300687.pdf (494.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02862629 , version 1 (10-03-2023)


Attribution - NonCommercial



Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas. Polynomial interrupt timed automata: Verification and expressiveness. Information and Computation, 2021, 277, pp.104580. ⟨10.1016/j.ic.2020.104580⟩. ⟨hal-02862629⟩
120 View
6 Download



Gmail Facebook Twitter LinkedIn More