RTSL: a language for real-time schedulability analysis
| Title | RTSL: a language for real-time schedulability analysis |
| Publication Type | Conference Papers |
| Year of Publication | 1993 |
| Authors | Fredette AN, Cleaveland R |
| Conference Name | Real-Time Systems Symposium, 1993., Proceedings. |
| Date Published | 1993/12/01/3 |
| Publisher | IEEE |
| ISBN Number | 0-8186-4480-X |
| Keywords | Algebra, Algorithm design and analysis, Dynamic scheduling, Failure analysis, finite state machines, finite state systems, formal logic, formal semantics, functional behavior, generalized approach, generalized schedulability analysis technique, Process algebra, Processor scheduling, reachable state space, Real time systems, real-time schedulability analysis, Real-Time Specification Language, real-time systems, RTSL, scheduling, Scheduling algorithm, scheduling discipline, Specification languages, state-based analysis, State-space methods, Time factors, Timing, timing behavior, timing constraints, timing exceptions |
| Abstract | The paper develops a generalized approach to schedulability analysis that is mathematically founded in a process algebra called RTSL. Within RTSL one may describe the functional behavior, timing behavior, timing constraints (or deadlines), and scheduling discipline for real-time systems. The formal semantics of RTSL then allows the reachable state space of finite state systems to be automatically generated and searched for timing exceptions. We provide a generalized schedulability analysis technique to perform this state-based analysis |
| DOI | 10.1109/REAL.1993.393489 |