Paper Info
Title
Enforcing applicability of real-time scheduling theory feasibility tests with the use of design-patterns
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.
Year
DOI
Venue
2010
10.1007/978-3-642-16558-0_3
formal methods
Keywords
Field
DocType
article deal,architecture model,feasibility test,real-time scheduling theory feasibility,decision tool,architectural model,deep understanding,analytical method,real-time scheduling theory,architecture designer,real-time embedded system,enforcing applicability,design pattern
Architecture model,Architecture,Scheduling theory,Computer science,Decision tool,Software design pattern,Engineering design process,Architectural model,Distributed computing
Conference
Volume
ISSN
ISBN
6415
0302-9743
3-642-16557-5
Citations 
PageRank 
References 
4
0.44
10
Authors
4
Name
Order
Citations
PageRank
Alain Plantec16711.41
Frank Singhoff29317.70
Pierre Dissaux3435.51
Jérôme Legrand4161.91