Return to search

Deriving ECA-rules from timed-automata specifications.

Real-time systems are required to answer to external stimuli within a specified time-period. For this to be possible, the systems behaviour must be predictable. The use of active databases in real-time systems introduces unpredictability in the system, e.g. due to their use of active rules. The behaviour in active databases is usually specified in ECA-rules. Sets of ECA-rules are hard to analyse, which implies that the behaviour of the ECA-rule set is hard to predict. The purpose of this project is to evaluate the ability to support the development of a predictable ECA-rule set. Using a formal method for the specification task is desirable, since a formal specification is analysable and can be proven correct. In this project, timed-automata are used for specifying the systems behaviour. A method for deriving predictable ECA-rules from a timed-automaton specification is developed, and successfully applied on a case-study specification. For this case-study specification, a set of ECA-rules preserving the analysed behaviour of the timed-automata specification is derived.

Identiferoai:union.ndltd.org:UPSALLA1/oai:DiVA.org:his-655
Date January 2002
CreatorsEricsson, Ann-Marie
PublisherHögskolan i Skövde, Institutionen för datavetenskap, Skövde : Institutionen för datavetenskap
Source SetsDiVA Archive at Upsalla University
LanguageSwedish
Detected LanguageEnglish
TypeStudent thesis, info:eu-repo/semantics/bachelorThesis, text
Formatapplication/postscript, application/pdf
Rightsinfo:eu-repo/semantics/openAccess, info:eu-repo/semantics/openAccess

Page generated in 0.0024 seconds