Component-based analysis of hierarchical scheduling using linear hybrid automata

Sun, Youcheng; Lipari, Giuseppe; Soulat, Romain; Fribourg, Laurent; Markey, Nicolas

doi:10.1109/rtcsa.2014.6910502

Cited by 13 publications

(16 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It uses the formal method tool UPPAAL to verify the system's schedulability. Moreover, there has been an approach based on linear hybrid automata [27]. Compared to other automatic theoretic formal method-based approaches to hierarchical scheduling, we take a distinctive approach based on a resource-bound real-time process algebra which has the notion of resources such as the first class entities and the notion of priorities to capture the resource contention among concurrent processes.…”

Section: Related Workmentioning

confidence: 99%

“…Specifically, while we consider both periodic and EDP resource models and various scheduling algorithms, the work [26] considers only the periodic resource model and less types of scheduling algorithms. Unlike ours, the work [27] only considers the cases where the global scheduler performs EDF among periodic servers and the tasks that have fixed priorities.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems

Park¹,

Lee²,

Sokolsky³

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Real-time embedded systems have increased in complexity. As microprocessors become more powerful, the software complexity of real-time embedded systems has increased steadily. The requirements for increased functionality and adaptability make the development of real-time embedded software complex and errorprone. Component-based design has been widely accepted as a compositional approach to facilitate the design of complex systems. It provides a means for decomposing a complex system into simpler subsystems and composing the subsystems in a hierarchical manner. A system composed of real-time subsystems with hierarchy is called a hierarchical real-time system This paper describes a process algebraic approach to schedulability analysis of hierarchical real-time systems. To facilitate modeling and analyzing hierarchical real-time systems, we conservatively extend an existing process algebraic theory based on ACSR-VP (Algebra of Communicating Shared Resources with ValuePassing) for the schedulability of real-time systems. We explain a method to model a resource model in ACSR-VP which may be partitioned for a subsystem. We also introduce schedulability relation to define the schedulability of hierarchical real-time systems and show that satisfaction checking of the relation is reducible to deadlock checking in ACSR-VP and can be done automatically by the tool support of ERSA (Verification, Execution and Rewrite System for ACSR). With the schedulability relation, we present algorithms for abstracting real-time system workloads. AbstractReal-time embedded systems have increased in complexity. As microprocessors become more powerful, the software complexity of real-time embedded systems has increased steadily. The requirements for increased functionality and adaptability make the development of real-time embedded software complex and errorprone. Component-based design has been widely accepted as a compositional approach to facilitate the design of complex systems. It provides a means for decomposing a complex system into simpler subsystems and composing the subsystems in a hierarchical manner. A system composed of real-time subsystems with hierarchy is called a hierarchical real-time system. This paper describes a process algebraic approach to schedulability analysis of hierarchical real-time systems. To facilitate modeling and analyzing hierarchical real-time systems, we conservatively extend an existing process algebraic theory based on ACSR-VP (Algebra of Communicating Shared Resources with Value-Passing) for the schedulability of real-time systems. We explain a method to model a resource model in ACSR-VP which may be partitioned for a subsystem. We also introduce schedulability relation to define the schedulability of hierarchical real-time systems and show that satisfaction checking of the relation is reducible to deadlock checking in ACSR-VP and can be done automatically by the tool support of VERSA (Verification, Execution and Rewrite System for ACSR). With the schedulability relation, we present algorit...

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems

Park¹,

Lee²,

Sokolsky³

et al. 2017

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

show abstract

“…Sun et al introduce a component-based framework [44] for the analysis of hierarchical scheduling systems encoded using hybrid automata. The authors prove the correctness of their models and study the decidability of the reachability (schedulability) analysis for the case of periodic tasks.…”

Section: Model-based Approaches To Schedulability Analysismentioning

confidence: 99%

Statistical and exact schedulability analysis of hierarchical scheduling systems

Boudjadar

David

Kim

et al. 2016

Science of Computer Programming

View full text Add to dashboard Cite

This paper contains two contributions: 1) A development methodology involving two techniques to enhance the resource utilization and 2) a new generic multi-core resource model for hierarchical scheduling systems. As the first contribution, we propose a two-stage development methodology relying on the adjustment of timing attributes in the detailed models during the design stage. We use a lightweight method (statistical model checking) for design exploration, easily assuring high confidence in the correctness of the models. Once a satisfactory design has been found, it can be proved schedulable using the computation costly method (symbolic model checking). In order to analyze a hierarchical scheduling system compositionally, we introduce the notion of a stochastic supplier modeling the supply of resources from each component to its child components in the hierarchy. We specifically investigate two different techniques to widen the set of provably schedulable systems: 1) a new supplier model; 2) restricting the potential task offsets. We also provide a way to estimate the minimum resource supply (budget) that a component is required to provide. In contrast to analytical methods, we prove nonschedulable cases via concrete counterexamples. By having richer and more detailed scheduling models this framework, has the potential to prove the schedulability of more systems. As the second contribution, we introduce a generic resource model for multi-core hierarchical scheduling systems, and show how it can be instantiated for classical resource models: Periodic Resource Models (PRM) and Explicit Deadline Periodic (EDP) resource models. The generic multi-core resource model is presented in the context of a compositional model-based approach for schedulability analysis of hierarchical scheduling systems. The multi-core framework presented in this paper is an extension of the single-core framework used for the analysis in the rest of the paper.

show abstract

“…Unfortunately, when being applied to concrete avionics systems, all of them suffer from an inevitable problem of state space explosion. For hierarchical scheduling systems, some studies [6,18,4] exploit the inherent temporal isolation of ARINC-653 partitions [1] and analyze each partition separately, but they ignore the behavior of the underlying network or the interactions among partitions. Thus these methods are not applicable to DIMA environments in which multiple distributed ARINC-653 partitions communicate through a shared network to perform an avionics function together.…”

Section: Introductionmentioning

confidence: 99%

A Compositional Approach for Schedulability Analysis of Distributed Avionics Systems

Han

Zhai

Nielsen

et al. 2018

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

This work presents a compositional approach for schedulability analysis of Distributed Integrated Modular Avionics (DIMA) systems that consist of spatially distributed ARINC-653 modules connected by a unified AFDX network. We model a DIMA system as a set of stopwatch automata in UPPAAL to verify its schedulability by model checking. However, direct model checking is infeasible due to the large state space. Therefore, we introduce the compositional analysis that checks each partition including its communication environment individually. Based on a notion of message interfaces, a number of message sender automata are built to model the environment for a partition. We define a timed selection simulation relation, which supports the construction of composite message interfaces. By using assume-guarantee reasoning, we ensure that each task meets the deadline and that communication constraints are also fulfilled globally. The approach is applied to the analysis of a concrete DIMA system.

show abstract

Component-based analysis of hierarchical scheduling using linear hybrid automata

Cited by 13 publications

References 24 publications

A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems

A process algebraic approach to the schedulability analysis and workload abstraction of hierarchical real-time systems

Statistical and exact schedulability analysis of hierarchical scheduling systems

A Compositional Approach for Schedulability Analysis of Distributed Avionics Systems

Contact Info

Product

Resources

About