A Event-B-Based Approach for Schedulability Analysis For Real-Time Scheduling Algorithms through Deadlock Detection

Jiale Quan, Qin Li

Abstract: Event-B is a refinement-based formal method that enables incremental modeling of complex systems and supports verifying system properties. Real-time systems adhere to strict timing constraints by the tasks within the system. The real-time scheduling algorithm serves as the cornerstone to guarantee the timely completion of tasks. Therefore, modeling real-time scheduling algorithms and verifying schedulability represent prominent areas of focus within the realm of real-time systems. While existing approaches often employ model checking, the scalability of the model and the problem of state explosion during verification remain challenges. Relying on theorem proving, Event-B allows for rigorous verification of system properties and circumvents state explosion. Benefiting from model refinement, the abstract model can be extended and refined to implement various scheduling algorithms.