An Executable Semantics of Clock Constraint Specification Language and Its Applications

  • Min Zhang
  • Frédéric Mallet
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 596)


The Clock Constraint Specification Language (ccsl) is a language to specify logical and timed constraints between logical clocks. Given a set of clock constraints specified in ccsl, formal analysis is preferred to check if there exists a schedule that satisfies all the constraints, if the constraints are valid or not, and if the constraints satisfy expected properties. In this paper, we present a formal executable semantics of ccsl in rewriting logic and demonstrate some applications of the formal semantics to its formal analysis: (1) to automatically find bounded or periodic schedules that satisfy all the given constraints; (2) to simulate the execution of schedules with customized simulation policies; and (3) to verify LTL properties of ccsl constraints by bounded model checking. Compared with other existing modeling approaches, advantages with the rewriting-based semantics of ccsl are that we do not need to assume a bounded number of steps for the formalization, and we can exhaustively explore all the solutions within a given bound for the analysis.


  1. 1.
    André, C.: Syntax and semantics of the Clock Constraint Specification Language (CCSL). Research Report 6925, INRIA (2009)Google Scholar
  2. 2.
    Benveniste, A., Caspi, P., Edwards, S.A., Halbwachs, N., Le Guernic, P., de Simone, R.: The synchronous languages 12 years later. Proc. IEEE 91(1), 64–83 (2003)CrossRefGoogle Scholar
  3. 3.
    Carloni, L.P., McMillan, K.L., Sangiovanni-Vincentelli, A.L.: Theory of latency-insensitive design. IEEE Trans. CAD Integr. Circ. Syst. 20(9), 1059–1076 (2001)CrossRefGoogle Scholar
  4. 4.
    Clavel, M., Durán, F., Eker, S., Lincoln, P., Martí-Oliet, N., Meseguer, J., Talcott, C. (eds.): All About Maude. LNCS, vol. 4350. Springer, Heidelberg (2007)zbMATHGoogle Scholar
  5. 5.
    Cousot, P.: Abstract interpretation. ACM Comput. Surv. 28(2), 324–328 (1996)CrossRefGoogle Scholar
  6. 6.
    Mallet, F., DeAntoni, J.: TimeSquare: treat your models with logical time. In: Furia, C.A., Nanz, S. (eds.) TOOLS 2012. LNCS, vol. 7304, pp. 34–41. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  7. 7.
    Eker, S., Meseguer, J., Sridharanarayanan, A.: The maude LTL model checker. In: 4th WRLA. ENTCS, vol. 71, pp. 162–187. Elsevier (2002)Google Scholar
  8. 8.
    Gascon, R., Mallet, F., DeAntoni, J.: Logical time and temporal logics: comparing UML MARTE/CCSL and PSL. In: Combi, C., Leucker, M., Wolter, F. (eds.) TIME, pp. 141–148. IEEE (2011)Google Scholar
  9. 9.
    Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Commun. ACM 21(7), 558–565 (1978)CrossRefzbMATHGoogle Scholar
  10. 10.
    Sutre, G., Leroux, J.: Flat counter automata almost everywhere!. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 489–503. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  11. 11.
    Mallet, F., André, C., de Simone, R.: CCSL: specifying clock constraints with UML/Marte. Innovations Syst. Softw. Eng. 4(3), 309–314 (2008)CrossRefGoogle Scholar
  12. 12.
    Mallet, F., Millo, J.V., de Simone, R.: Safe CCSL specifications and marked graphs. In: 11th ACM/IEEE International Conference on Formal Methods and Models for Codesign, pp. 157–166. IEEE (2013)Google Scholar
  13. 13.
    Mallet, F., de Simone, R.: Correctness issues on MARTE/CCSL constraints. Sci. Comput. Program. 106, 78–92 (2015)CrossRefGoogle Scholar
  14. 14.
    Potop-Butucaru, D., de Simone, R., Talpin, J.: The Synchronous Hypothesis and Polychronous Languages, chap. 6. CRC Press (2009)Google Scholar
  15. 15.
    Yin, L., Mallet, F., Liu, J.: Verification of MARTE/CCSL time requirements in Promela/SPIN. In: Perseil, I., Breitman, K., Sterritt, R. (eds.) ICECCS, pp. 65–74. IEEE Computer Society (2011)Google Scholar
  16. 16.
    Yu, H., Talpin, J., Besnard, L., Gautier, T., Marchand, H., Guernic, P.L.: Polychronous controller synthesis from MARTE/CCSL timing specifications. In: 9th IEEE/ACM International Conference on Formal Methods and Models for Codesign, MEMOCODE, pp. 21–30. IEEE (2011)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Authors and Affiliations

  1. 1.Shanghai Key Laboratory of Trustworthy ComputingEast China Normal UniversityShanghaiChina
  2. 2.University of Nice Sophia Antipolis, I3S, UMR 7271 CNRSNiceFrance
  3. 3.INRIA Sophia Antipolis MéditerranéeValbonneFrance

Personalised recommendations