An Executable Semantics of Clock Constraint Specification Language and Its Applications

Min Zhang, Frédéric Mallet

Abstract

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.
BibTeX
@inproceedings{zhang2015executable,
  author = {Min Zhang and Frédéric Mallet},
  title = {{An Executable Semantics of Clock Constraint Specification Language and Its Applications}},
  booktitle = {FTSCS},
  year = {2015},
  doi = {10.1007/978-3-319-29510-7\_2},
}

Loading related content...

Figure