RTSL: a language for real-time schedulability analysis

Author

Fredette, Andre N. ; Cleaveland, Rance

Author_Institution

IBM Corp., Research Triangle Park, NC, USA

fYear

1993

fDate

1-3 Dec 1993

Firstpage

274

Lastpage

283

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

Keywords

finite state machines; formal logic; process algebra; real-time systems; scheduling; specification languages; RTSL; Real-Time Specification Language; finite state systems; formal semantics; functional behavior; generalized approach; generalized schedulability analysis technique; process algebra; reachable state space; real-time schedulability analysis; scheduling discipline; state-based analysis; timing behavior; timing constraints; timing exceptions; Algebra; Algorithm design and analysis; Dynamic scheduling; Failure analysis; Processor scheduling; Real time systems; Scheduling algorithm; State-space methods; Time factors; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Real-Time Systems Symposium, 1993., Proceedings.

Conference_Location

Raleigh Durham, NC

Print_ISBN

0-8186-4480-X

Type

conf

DOI

10.1109/REAL.1993.393489

Filename

393489