Schedulability analysis for independent partitions in integrated modular avionics systems

Author(s):  
Jinchao Chen ◽  
Chenglie Du
2018 ◽  
Vol 2018 ◽  
pp. 1-22 ◽  
Author(s):  
Lisong Wang ◽  
Miaofang Chen ◽  
Jun Hu

The configuration information of Integrated Modular Avionics (IMA) system includes almost all details of whole system architecture, which is used to configure the hardware interfaces, operating system, and interactions among applications to make an IMA system work correctly and reliably. It is very important to ensure the correctness and integrity of the configuration in the IMA system design phase. In this paper, we focus on modelling and verification of configuration information of IMA/ARINC653 system based on MARTE (Modelling and Analysis for Real-time and Embedded Systems). Firstly, we define semantic mapping from key concepts of configuration (such as modules, partitions, memory, process, and communications) to components of MARTE element and propose a method for model transformation between XML-formatted configuration information and MARTE models. Then we present a formal verification framework for ARINC653 system configuration based on theorem proof techniques, including construction of corresponding REAL theorems according to the semantics of those key components of configuration information and formal verification of theorems for the properties of IMA, such as time constraints, spatial isolation, and health monitoring. After that, a special issue of schedulability analysis of ARINC653 system is studied. We design a hierarchical scheduling strategy with consideration of characters of the ARINC653 system, and a scheduling analyzer MAST-2 is used to implement hierarchical schedule analysis. Lastly, we design a prototype tool, called Configuration Checker for ARINC653 (CC653), and two case studies show that the methods proposed in this paper are feasible and efficient.


PLoS ONE ◽  
2016 ◽  
Vol 11 (12) ◽  
pp. e0168064 ◽  
Author(s):  
Jinchao Chen ◽  
Chenglie Du ◽  
Pengcheng Han

2002 ◽  
Author(s):  
J. Javier Gutiérrez ◽  
José M. Drake ◽  
Michael González Harbour ◽  
Julio L. Medina

2021 ◽  
Vol 20 (1) ◽  
pp. 1-26
Author(s):  
Paolo Pazzaglia ◽  
Youcheng Sun ◽  
Marco Di Natale

2012 ◽  
Vol 5 (1) ◽  
pp. 245-255 ◽  
Author(s):  
Thierry LeSergent ◽  
Frederic Romeas ◽  
Olivier TOURILLION

2015 ◽  
Vol 741 ◽  
pp. 856-859
Author(s):  
Yan Feng Zhai ◽  
Feng Xiang Zhang

This papercarries out a survey of sufficient schedulability analysis forfixed priority (FP) scheduling. The most common used fixed priority assignment is the rate monotonic (RM) algorithm, according to its policy, the task priorities are ordered based on their activation rates, so that the task with the shortest period is assigned the highest priority. However, when each task’s relative deadline is not equal to its period, the RM algorithm is not suitable to assign the task priorities. When relative deadlines are less than or equal to periods,the deadline monotonic (DM) algorithm can be deployed to schedule the tasks. The utilization based schedulability analysis has the advantage of simple implementation, and manyexisting schedulability analyses on uniprocessor are covered.


Sign in / Sign up

Export Citation Format

Share Document