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.
| Original language | English |
|---|---|
| Article number | 8485678 |
| Pages (from-to) | 58418-58426 |
| Number of pages | 9 |
| Journal | IEEE Access |
| Volume | 6 |
| DOIs | |
| Publication status | Published - 2018 Jan 1 |
Keywords
- Constraint satisfaction problem
- real-time schedulability analysis
- satisfiability modulo theories
ASJC Scopus subject areas
- Computer Science(all)
- Materials Science(all)
- Engineering(all)