A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems

Carnevali, Laura; Lipari, Giuseppe; Pinzuti, Alessandro; Vicario, Enrico

doi:10.1007/978-3-642-21338-0_9

Cited by 10 publications

(11 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, consider that in most practical cases, the number of tasks inside one application is limited to a few units. Also, component-based analysis abstracts away the rest of the system and hence it is much less complex than analysing the entire system as a whole, as shown in [13].…”

Section: A Scheduler Automatonmentioning

confidence: 99%

See 1 more Smart Citation

Component-based analysis of hierarchical scheduling using linear hybrid automata

Sun

Lipari

Soulat

et al. 2014

2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications

Self Cite

View full text Add to dashboard Cite

Formal methods (e.g. Timed Automata or Linear Hybrid Automata) can be used to analyse a real-time system by performing a reachability analysis on the model. The advantage of using formal methods is that they are more expressive than classical analytic models used in schedulability analysis. For example, it is possible to express state-dependent behaviour, arbitrary activation patterns, etc.In this paper we use the formalism of Linear Hybrid Automata to encode a hierarchical scheduling system. In particular, we model a dynamic server algorithm and the tasks contained within, abstracting away the rest of the system, thus enabling component-based scheduling analysis. We prove the correctness of the model and the decidability of the reachability analysis for the case of periodic tasks. Then, we compare the results of our model against classical schedulability analysis techniques, showing that our analysis performs better than analytic methods in terms of resource utilisation. We further present two case studies: a component with state-dependent tasks, and a simplified model of a real avionics system. Finally, through extensive tests with various configurations, we demonstrate that this approach is usable for medium-size components.

show abstract

Section: A Scheduler Automatonmentioning

confidence: 99%

“…A component based analysis of hierarchical real-time systems is proposed in [13], [14]. The authors use the model of Preemptive Timed Petri Nets (pTPN), to model a hierarchical systems, and are able to perform analysis of independent applications.…”

Section: State Of the Artmentioning

confidence: 99%

Component-based analysis of hierarchical scheduling using linear hybrid automata

Sun

Lipari

Soulat

et al. 2014

2014 IEEE 20th International Conference on Embedded and Real-Time Computing Systems and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Nevertheless, the modeling method does not cover any ARINC-653 features and is only applicable to federated avionics. In [24], the theory of pTPN is introduced to support exact schedulability analysis of two-level hierarchical scheduling systems. This approach is extended in [6] with a concept of required interface that models the environment of each application to enable compositional analysis of hierarchical scheduling systems encompassing interapplication communications between periodic tasks.…”

Section: Related Work and Contributionsmentioning

confidence: 99%

“…(23) instead of the original goal Eq. (24). The same steps will be repeated for local properties φ 2 and φ 3 .…”

Section: Deductionmentioning

confidence: 99%

Schedulability Analysis of Distributed Multicore Avionics Systems with UPPAAL

Han

Zhai

Nielsen

et al. 2019

Journal of Aerospace Information Systems

View full text Add to dashboard Cite

This paper presents an approach for schedulability analysis of Distributed Integrated Modular Avionics (DIMA) systems that consist of spatially distributed ARINC-653 multicore modules connected by a unified Avionics Full-Duplex Switched Ethernet (AFDX) network. A multicore DIMA system is modeled as a set of stopwatch automata in UPPAAL to verify its schedulability by model checking. However, direct verification is infeasible due to the large state space. Therefore, global analysis based on statistical model checking (SMC) and compositional analysis based on classical model checking are combined, thereby mitigating the state space explosion problem. Even though the nature of SMC testing cannot prove schedulability, the model of a DIMA system first undergoes quick schedulability falsification using global SMC analysis. Thereafter, a compositional approach is used to check each partition, including its communication environment individually. By using assume-guarantee reasoning, it is ensured that each real-time task meets the deadline and that communication constraints are also fulfilled globally. The approach is finally applied to the schedulability analysis of a concrete multicore DIMA system.

show abstract

“…The first one usually uses a compositional approach to formally specify and analyze the schedulability of real-time applications running under the two-level scheduling. The recent work is discussed in [87,88]. It considers the application but not the separation kernels.…”

Section: Temporal Separation Verificationmentioning

confidence: 99%

A survey on formal specification and verification of separation kernels

Zhao¹,

Yang

Ma³

2017

Front. Comput. Sci.

View full text Add to dashboard Cite

Separation kernels are fundamental software of safety and security-critical systems, which provide to their hosted applications spatial and temporal separation as well as controlled information flows among partitions. The application of separation kernels in critical domain demands the correctness of the kernel by formal verification. To the best of our knowledge, there is no survey paper on this topic. This paper presents an overview of formal specification and verification of separation kernels. We first present the background including the concept of separation kernel and the comparisons among different kernels. Then, we survey the state of the art on this topic since 2000. Finally, we summarize research work by detailed comparison and discussion.

show abstract

A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems

Cited by 10 publications

References 27 publications

Component-based analysis of hierarchical scheduling using linear hybrid automata

Component-based analysis of hierarchical scheduling using linear hybrid automata

Schedulability Analysis of Distributed Multicore Avionics Systems with UPPAAL

A survey on formal specification and verification of separation kernels

Contact Info

Product

Resources

About