Constraint Solving Approach to Schedulability Analysis in Real-Time Systems
- Authors
- Lee, Hyuk; Choi, Jin-Young
- Issue Date
- 2018
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Constraint satisfaction problem; satisfiability modulo theories; real-time schedulability analysis
- Citation
- IEEE ACCESS, v.6, pp.58418 - 58426
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE ACCESS
- Volume
- 6
- Start Page
- 58418
- End Page
- 58426
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/80908
- DOI
- 10.1109/ACCESS.2018.2874637
- ISSN
- 2169-3536
- Abstract
- 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.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.