Skip to Main content Skip to Navigation
Conference papers

From Logical Time Scheduling to Real-Time Scheduling

Frédéric Mallet 1, 2 Min Zhang 3
2 KAIROS - Logical Time for Formal Embedded System Design
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Scheduling is a central yet challenging problem in real-time embedded systems. The Clock Constraint Specification Language (CCSL) provides a formalism to specify logical constraints of events in real-time embedded systems. A prerequisite for the events is that they must be schedulable under constraints. That is, there must be a schedule which controls all events to occur infinitely often. Schedulability analysis of CCSL raises important algorithmic problems such as computational complexity and design of efficient decision procedures. In this work, we compare the scheduling problems of CCSL specifications to the real-time scheduling problem. We show how to encode a simple task model in CCSL and discuss some benefits and differences compared to more classical scheduling strategies.
Document type :
Conference papers
Complete list of metadata
Contributor : Team Kairos Connect in order to contact the contributor
Submitted on : Monday, January 7, 2019 - 2:20:26 PM
Last modification on : Thursday, May 20, 2021 - 9:20:01 AM


  • HAL Id : hal-01971976, version 1



Frédéric Mallet, Min Zhang. From Logical Time Scheduling to Real-Time Scheduling. 39th IEEE Real-Time Systems Symposium, Dec 2018, Nashville, United States. ⟨hal-01971976⟩



Record views