Timing analysis of reactive rule-based programs

Predictability is the crucial feature of real-time systems. It requires that all the tasks in a system meet their timing constraints. For an embedded complex system involving a number of subsystems, the timing properties of the subsystems play an important role, since the total system’s response dep...

Full description

Saved in:
Bibliographic Details
Published in:Control engineering practice 1998-03, Vol.6 (3), p.403-408
Main Authors: Lin, Man, Malec, Jacek
Format: Article
Language:English
Subjects:
embedded systems
layered software
rule-based programming
Timing analysis
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Predictability is the crucial feature of real-time systems. It requires that all the tasks in a system meet their timing constraints. For an embedded complex system involving a number of subsystems, the timing properties of the subsystems play an important role, since the total system’s response depends on the temporal behaviour of all the subsystems. In this paper, the timing properties of reactive programs written in a rule-based language R L are analyzed. R L is a relatively simple rule language for programming the discrete part of hybrid applications, implemented using a layered architecture. The language has already been used in prototyping a complex automotive application. The upper timing bounds for R L programs, executed using either of the two evaluation strategies, have been studied. Moreover, an analysis tool has been implemented and applied to derive the timing behaviour of a non-trivial application. Some comments on the temporal behaviour of a layered system, consisting of a discrete R L program combined with a set of periodic tasks, are given.
ISSN:0967-0661
1873-6939
DOI:10.1016/S0967-0661(98)00018-5