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

Development of an Analysis tool for Execution Traces

Fulltext:


Authors:

Anders Johnsson , Roy Nilsson

Publication Type:

Student Thesis


Abstract

In this thesis we present the Probabilistic Property Language (PPL) and a supporting tool. The purpose of this language is to analyse real-time systems based on information in execution traces. Traditional real-time analysis, e.g. fixed priority analysis, tends to be too pessimistic. Systems that does work can sometimes be deemed unschedulable since only worst case times, e.g. execution times or minimum inter arrival times, are considered. This is a problem when the worst cases are unlikely or never occur in the system. Furthermore these methods of analysis have no mean of checking properties like non emptiness of a message queue. To deal with that a simulation based analysis method was developed [13][14] . Using a modelling language a model of the system is constructed. Changes can then be made in this model before they are implemented in the system. Executing this model in a simulator will result in a trace. The trace contains information about task switches and probe observations that will be used to analyse the system with the help of PPL. A PPL query is formulated as a probabilistic statement, stating for example that some property should always be true, e.g. meeting a hard deadline, would be to formulate it as having a probability of 1. The probe observations contain information about system resource usage and other more application specific information. They could for example contain the size of a message queue. This could be used to verify requirements that could not be checked using fixed priority analysis like for example a message queue never being empty. Many different properties like precedence, separation and pre-emption can be formulated using PPL. In addition to this the query can contain an unbounded variable. This variable can be used to retrieve various constraint values , e.g. to find what deadline is met with a given probability.

Bibtex

@mastersthesis{Johnsson633,
author = {Anders Johnsson and Roy Nilsson},
title = {Development of an Analysis tool for Execution Traces},
month = {September},
year = {2004},
url = {http://www.es.mdu.se/publications/633-}
}