You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.
The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.
For the reports in this repository we specifically note that
- the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
- the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
- technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
- in other cases, please contact the copyright owner for detailed information
By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.
If you are in doubt, feel free to contact webmaster@ide.mdh.se
Timed Automata as Task Models for Event-Driven Systems
Publication Type:
Conference/Workshop Paper
Venue:
In proceedings of RTCSA99
Publisher:
IEEE Computer Society
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.We show that the schedulability problem for the extended model can
be transformed to a reachability problem for standard timed automata and
thus it is decidable. This allows us to apply model-checking tools
for timed automata to schedulability analysis for event-driven
systems. In addition, based on the same model of a system, we may use
the tools to verify other properties (e.g. safety and functionality)
of the system. This unifies schedulability analysis and formal verification
in one framework. We present an example where the model-checker UPPAAL
is applied to check the schedulability and safety properties of
a control program for a turning lathe.
Bibtex
@inproceedings{Norstrom69,
author = {Christer Norstr{\"o}m and Anders Wall},
title = {Timed Automata as Task Models for Event-Driven Systems},
month = {December},
year = {1999},
booktitle = {In proceedings of RTCSA99},
publisher = {IEEE Computer Society},
url = {http://www.es.mdu.se/publications/69-}
}