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

Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Fulltext:


Publication Type:

Conference/Workshop Paper

Venue:

FASE12: Proceedings of the 15th International Conference on Fundamental Approaches to Software Engineering

Publisher:

Springer-Verlag Berlin Heidelberg


Abstract

We present a framework for modeling and analysis of adaptive embedded systems, based on the model of timed automata with tasks. The model is extended with primitives allowing modeling of adaptivity, by testing the potential schedulability of a given task, in the context of the set of currently enqueued tasks. This makes it possible to describe adaptive embedded systems, in which decisions to admit further tasks or take other measures of adaptivity is based on available CPU resources, external, or internal events. We show that this model can be encoded in the framework of timed automata, and hence that the problem is decidable. We also validate the framework, by using the Uppaal tool.

Bibtex

@inproceedings{Hatvani1455,
author = {Leo Hatvani and Paul Pettersson and Cristina Seceleanu},
title = {Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems},
editor = {Juan de Lara and Andrea Zisman},
pages = {115--129},
month = {March},
year = {2012},
booktitle = {FASE12: Proceedings of the 15th International Conference on Fundamental Approaches to Software Engineering},
publisher = {Springer-Verlag Berlin Heidelberg},
url = {http://www.es.mdh.se/publications/1455-}
}