Adaptive Task Automata: A Framework for Verifying Adaptive Embedded Systems

Abstract

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.

Modeling and analysis of adaptive embedded systems using adaptive task automata

“…The full formal description of the work can be found in our recent paper [9]. In Figure 3, we present an adaptive task automaton similar to the task automaton from Figure 1, but extended with the schedulability predicate sched/1, and another edge and task that can be released in case that the original task would not complete before its deadline.…”

“…In this work, we present a high-level overview of the Adaptive Task Automata (ATA) framework (section 3) that we have recently proposed [9] as a model of adaptive embedded behavior. We have mainly focused on providing the possibility to model and verify systems where the task set can be regulated based on the extra-functional system properties.…”