In real-time systems, the satisfaction of real-time properties is as important as the correct behavior of the function. There are many safety-critical systems among the real-time systems, and thus, the satisfaction of real-time properties is directly related to safety in those cases. By performing the schedulability analysis, we can predict the behavior of real-time systems and ensure that real-time properties are met. In this paper, we propose the schedulability analysis of a real-time system through a constraint solving approach, that is, by treating a scheduling problem as a constraint solving problem. To do this, we describe a method of representing the task behavior and schedulable properties of real-time tasks in the form of constraints and finding answers that satisfy all the constraints using a constraint solver.
Bibliographical noteFunding Information:
This work was supported in part by the Ministry of Science and ICT (MSIT), Korea, through the Information Technology Research Center Support Program supervised by the Institute for Information & Communications Technology Promotion (IITP) under Grant 2015-0-00445 and in part by the IITP Grant through the Korea Government (MSIT) [Development of High-Assurance(≥EAL6) Secure Microkernel] under Grant 2018-0-00532.
© 2018 IEEE.
- Constraint satisfaction problem
- real-time schedulability analysis
- satisfiability modulo theories
ASJC Scopus subject areas
- General Computer Science
- General Materials Science
- General Engineering