Formal Verification and Implementation of Real-Time Applications

Abstract

This paper presents a method for the formal description, verification and automatic source code generation of embedded real-time multitasking applications, based on a model consisting of networks of timed automata. The model describes a real-time operating system kernel and application tasks, taking into consideration both non-preemptive and preemptive scheduling. The timing properties of theproposed model can be verified using a modelchecking tool. We also provide a solution for C source code generation based on the application’s model. For this purpose a unified resource access interface was implemented.

Keywords

• embedded real-time multitasking applications
• cooperative scheduler model
• pre-emptive application tasks