skip to main content

Title: A comparison of schedulability analysis methods using state and digraph models for the schedulability analysis of synchronous FSMs
Authors:
; ;
Award ID(s):
1812963 1739318
Publication Date:
NSF-PAR ID:
10101510
Journal Name:
Real-Time Systems
Volume:
55
Issue:
3
Page Range or eLocation-ID:
598 to 638
ISSN:
0922-6443
Sponsoring Org:
National Science Foundation
More Like this
  1. Formal verification of real-time systems is attractive because these systems often perform critical operations. Unlike non real-time systems, latency and response time guarantees are of critical importance in this setting, as much as functional correctness. Nevertheless, formal verification of real-time OSes usually stops the scheduling analysis at the policy level: they only prove that the scheduler (or its abstract model) satisfies some scheduling policy. In this paper, we go further and connect together Prosa, a verified schedulability analyzer, and RT-CertiKOS, a verified single-core sequential real-time OS kernel. Thus, we get a more general and extensible schedulability analysis proof for RT-CertiKOS, as well a concrete implementation validating Prosa models. It also showcases that it is realistic to connect two completely independent formal developments in a proof assistant.