Schedulability analysis with CCSL specifications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Schedulability analysis with CCSL specifications


The Clock Constraint Specification Language (CCSL) is a formal polychronous language based on the notion of logical clock. It defines a set of kernel constraints that can represent both asynchronous and synchronous relations. It was originally developed as part of the UML Profile for MARTE to express causal and temporal constraints of Real-time and Embedded Systems. In this paper, we explore the use of CCSL for modeling scheduling requirements and to conduct schedulability analysis. For this purpose, a dedicated scheduling library of CCSL has been built. This library is endowed with a state-based operational semantics, and is applied to solve issues related to schedulability analysis and latency-insensitive design. We establish schedulability categories and latency-insensitiveness property in the context of the semantics, and solve those issues by using model checking techniques.
Fichier principal
Vignette du fichier
12 APSEC13.pdf (344.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Licence : Copyright

Dates and versions

hal-00926305 , version 1 (03-12-2022)



Ling Yin, Jing Liu, Zuohua Ding, Frédéric Mallet, Robert de Simone. Schedulability analysis with CCSL specifications. APSEC 2013 - 20th Asia-Pacific Software Engineering Conference, Dec 2013, Bangkok, Thailand. pp.414-421, ⟨10.1109/APSEC.2013.62⟩. ⟨hal-00926305⟩
167 View
11 Download



Gmail Facebook Twitter LinkedIn More