A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Real-Time Scheduling Theory and Ada
Computer
Handbook of theoretical computer science (vol. B)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Engineering and Analysis of Fixed Priority Schedulers
IEEE Transactions on Software Engineering
Timing Analysis for Fixed-Priority Scheduling of Hard Real-Time Systems
IEEE Transactions on Software Engineering
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
A Methodology for the Construction of Scheduled Systems
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Beyond HYTECH: Hybrid Systems Analysis Using Interval Numerical Methods
HSCC '00 Proceedings of the Third International Workshop on Hybrid Systems: Computation and Control
| Hi-index | 0.00 |
A formal framework is proposed for the verification of complex real-time systems, modeled as client-server scheduling systems, using the popular model-checking approach. Model-checking is often restricted by the large state-space of complex real-time systems. The scheduling of tasks in such systems can be taken advantage of for model-checking. Our implementation and experiments corroborate the feasibility of such an approach. Wide-applicability, significant state-space reduction, and several scheduling semantics are some of the important features in our theory and implementation.