TY - CONF T1 - RTSL: a language for real-time schedulability analysis T2 - Real-Time Systems Symposium, 1993., Proceedings. Y1 - 1993 A1 - Fredette,A. N A1 - Cleaveland, Rance KW - Algebra KW - Algorithm design and analysis KW - Dynamic scheduling KW - Failure analysis KW - finite state machines KW - finite state systems KW - formal logic KW - formal semantics KW - functional behavior KW - generalized approach KW - generalized schedulability analysis technique KW - Process algebra KW - Processor scheduling KW - reachable state space KW - Real time systems KW - real-time schedulability analysis KW - Real-Time Specification Language KW - real-time systems KW - RTSL KW - scheduling KW - Scheduling algorithm KW - scheduling discipline KW - Specification languages KW - state-based analysis KW - State-space methods KW - Time factors KW - Timing KW - timing behavior KW - timing constraints KW - timing exceptions AB - 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 JA - Real-Time Systems Symposium, 1993., Proceedings. PB - IEEE SN - 0-8186-4480-X M3 - 10.1109/REAL.1993.393489 ER -