Polynomial Interrupt Timed Automata

Béatrice Bérard (1) , Serge Haddad (2) , Claudine Picaronny (2) , Mohab Safey El Din (3) , Mathieu Sassolas (4)

1 MoVe - Modélisation et Vérification
2 MEXICO - Modeling and Exploitation of Interaction and Concurrency
3 PolSys - Polynomial Systems
4 LACL - Laboratoire d'Algorithmique Complexité et Logique

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 decomposition method for the first-order theory of reals. Compared to previous approaches, our procedure handles parameters and clocks in a unified way. We also obtain decidability for the model checking of a timed version of CTL and for reachability in several extensions of polITA.

Domaines: Informatique [cs]

Béatrice Bérard, Serge Haddad, Claudine Picaronny, Mohab Safey El Din, Mathieu Sassolas. Polynomial Interrupt Timed Automata. The 9th Workshop on Reachability Problems (RP'15), Sep 2015, Warsaw, Poland. pp.20-32, ⟨10.1007/978-3-319-24537-9_3⟩. ⟨hal-01222572⟩