Timed Automata as Task Models for Event-Driven Systems

Abstract

In this paper, we extend the classic model of timed automata with a notion of real time tasks. The main idea is to associate each discrete transition in a timed automaton with a task (an executable program). Intuitively, a discrete transition in an extended timed automaton denotes an event releasing a task and the guard on the transition specifies all the possible arriving times of the event (instead of the so-- called minimal inter-arrival time). This yields a general model for hard real-time systems in which tasks may be periodic and non-periodic