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.

[1]  Robert de Simone,et al.  From Concurrent Multi-clock Programs to Deterministic Asynchronous Implementations , 2009, ACSD.

[2]  Eugene Asarin,et al.  Scheduling with timed automata , 2006, Theor. Comput. Sci..

[3]  Julien DeAntoni,et al.  Progressive and explicit refinement of scheduling for multidimensional data-flow applications using uml marte , 2012, Des. Autom. Embed. Syst..

[4]  Julien DeAntoni,et al.  Scheduling Multi Clock Real Time Systems: From Requirements to Implementation , 2011, 2011 14th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing.

[5]  Robert de Simone,et al.  Safe CCSL specifications and marked graphs , 2013, 2013 Eleventh ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE 2013).

[6]  Yves Sorel,et al.  From high-level modelling of time in MARTE to real- time scheduling analysis , 2008 .

[7]  Insup Lee,et al.  PADS: An approach to modeling resource demand and supply for the formal analysis of hierarchical scheduling , 2012, Theor. Comput. Sci..

[8]  Didier Lime,et al.  A translation based method for the timed analysis of scheduling extended time Petri nets , 2004, 25th IEEE International Real-Time Systems Symposium.

[9]  Charles André,et al.  Marte CCSL to Execute East-ADL Timing Requirements , 2009, 2009 IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing.

[10]  Enrico Vicario,et al.  Modeling flexible real time systems with preemptive time Petri nets , 2003, 15th Euromicro Conference on Real-Time Systems, 2003. Proceedings..

[11]  Jing Liu,et al.  Verification of MARTE/CCSL Time Requirements in Promela/SPIN , 2011, 2011 16th IEEE International Conference on Engineering of Complex Computer Systems.

[12]  Alberto L. Sangiovanni-Vincentelli,et al.  Theory of latency-insensitive design , 2001, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[13]  Robert de Simone,et al.  Dealing with AADL End-to-End Flow Latency with UML MARTE , 2008, 13th IEEE International Conference on Engineering of Complex Computer Systems (iceccs 2008).

[14]  Julien Deantoni,et al.  Logical time at work: Capturing data dependencies and platform constraints , 2010 .

[15]  Robert de Simone,et al.  MARTE vs. AADL for Discrete-Event and Discrete-Time Domains , 2008, FDL.

[16]  Julien DeAntoni,et al.  The Time Model of Logical Clocks Available in the OMG MARTE Profile , 2010, Synthesis of Embedded Software.

[17]  Edward A. Lee,et al.  Ptolemy: A Framework for Simulating and Prototyping Heterogenous Systems , 2001, Int. J. Comput. Simul..

[18]  Frédéric Mallet Automatic generation of observers from MARTE/CCSL , 2012, 2012 23rd IEEE International Symposium on Rapid System Prototyping (RSP).

[19]  Wang Yi,et al.  TIMES: A Tool for Schedulability Analysis and Code Generation of Real-Time Systems , 2003, FORMATS.

[20]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[21]  Stephen A. Edwards,et al.  The synchronous languages 12 years later , 2003, Proc. IEEE.

[22]  Edward A. Lee,et al.  A framework for comparing models of computation , 1998, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..