Hierarchical timed abstract state machines for WCET estimation

Abstract : In this paper, we present an extension of the abstract state machines suited for the modelling of complex processors in the context of system verification. Besides processor simulation, the goal of our model is to provide a base for worst-case execution time estimation, providing abstraction capabilities that enable the scaling of analysis. The main difference between our model and other ASM extensions is that we define time as a mean to enable time accurate runs and hierarchical abstraction levels of components, while staying the closest possible to the original ASM mathematical foundation. The model is also designed to dynamically choose a suited component definition in order to adapt to information precision on data values. The time extension helps modelling non-instantaneous actions, which is essential for real-time systems. Adaptable precision and separation of the analysis from the model of the processor will prove well suited for integration into a worst-case execution time estimation tool.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01762677
Contributor : David Filliat <>
Submitted on : Tuesday, April 10, 2018 - 1:04:57 PM
Last modification on : Wednesday, July 3, 2019 - 10:48:05 AM

Links full text

Identifiers

Citation

Vladimir-Alexandru Paun, Bruno Monsuez, Philippe Baufreton. Hierarchical timed abstract state machines for WCET estimation. International Journal of Critical Computer-Based Systems, Inderscience, 2016, 6 (4), pp.343-363. ⟨10.1504/IJCCBS.2016.081810⟩. ⟨hal-01762677⟩

Share

Metrics

Record views

127