Enforcing applicability of real-time scheduling theory feasibility tests with the use of design-patterns

  • Authors:

  • Alain Plantec;Frank Singhoff;Pierre Dissaux;Jérôme Legrand

  • Affiliations:

  • LISyC, University of Brest, Brest, France;LISyC, University of Brest, Brest, France;Ellidiss Technologies, Brest, France;Ellidiss Technologies, Brest, France

  • Venue:
  • ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This article deals with performance verifications of architecture models of real-time embedded systems. We focus on models verified with the real-time scheduling theory. To perform verifications with the real-time scheduling theory, the architecture designers must check that their models are compliant with the assumptions of this theory. Unfortunately, this task is difficult since it requires that designers have a deep understanding of the real-time scheduling theory. In this article, we investigate how to help designers to check that an architecture model is compliant with this theory. We focus on feasibility tests. Feasibility tests are analytical methods proposed by the real-time scheduling theory. We show how to explicitly model the relationships between an architectural model and feasibility tests. From these models, we apply a model-based engineering process to generate a decision tool what is able to detect from an architecture model which are the feasibility tests that the designer can apply.