Timed Automata Model of Preemptive Multitasking Applications

Abstract

The aim of this article is to show, how a multitasking application running under a real-time operating system compliant with the OSEK/VDX standard can be modeled by timed automata. The application under consideration consists of several tasks, it includes resource sharing and synchronization by events. For such system, model-checking theory based on timed automata and implemented in model-checking tools can be used to verify time and logical properties of the proposed model. It is shown that the proposed model is over-approximation in the case of preemptive scheduling policy. This methodology is demonstrated on automated gearbox case study.