TY - JOUR
T1 - Constraint solving approach to schedulability analysis in real-time systems
AU - Lee, Hyuk
AU - Choi, Jin Young
N1 - Funding 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.
PY - 2018
Y1 - 2018
N2 - 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.
AB - 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.
KW - Constraint satisfaction problem
KW - real-time schedulability analysis
KW - satisfiability modulo theories
UR - http://www.scopus.com/inward/record.url?scp=85054520079&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85054520079&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2018.2874637
DO - 10.1109/ACCESS.2018.2874637
M3 - Article
AN - SCOPUS:85054520079
VL - 6
SP - 58418
EP - 58426
JO - IEEE Access
JF - IEEE Access
SN - 2169-3536
M1 - 8485678
ER -