Polynomial Interrupt Timed Automata
Abstract
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 the decidability of the reachability and model checking of a timed version of CTL by 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. Moreover, we show that PolITA are incomparable with stopwatch automata. Finally additional features are introduced while preserving decidability.
Cite
@article{arxiv.1504.04541,
title = {Polynomial Interrupt Timed Automata},
author = {Béatrice Bérard and Serge Haddad and Claudine Picaronny and Mohab Safey El Din and Mathieu Sassolas},
journal= {arXiv preprint arXiv:1504.04541},
year = {2015}
}