Formalising scheduling theories in duration calculus

Authors:
Qiwen Xu;Naijun Zhan
Affiliations:
Faculty of Science and Technology, University of Macau, Macau, SAR, P.R. China;Lab.of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
Nordic Journal of Computing
Year:
2008

Citing 20
Cited 0

Predicate calculus and program semantics

Predicate calculus and program semantics
A theory of timed automata

Theoretical Computer Science
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Liu and Layland's schedulability test revisited

Information Processing Letters
Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications

Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications
Scheduler Modeling Based on the Controller Synthesis Paradigm

Real-Time Systems
A Formal Proof of the Deadline Driven Scheduler

ProCoS Proceedings of the Third International Symposium Organized Jointly with the Working Group Provably Correct Systems on Formal Techniques in Real-Time and Fault-Tolerant Systems
An Extended Duration Calculus for Hybrid Real-Time Systems

Hybrid Systems
A Machine-Checked Proof of the Optimality of a Real-Time Scheduling Policy

CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
A Set-Theoretic Model for Real-Time Specification and Reasoning

MPC '98 Proceedings of the Mathematics of Program Construction
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Formal Proof of the Rate Monotonic Scheduler

RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Another formal proof for Deadline Driven Scheduler

RTCSA '00 Proceedings of the Seventh International Conference on Real-Time Systems and Applications
Symbolic Schedulability Analysis of Real-Time Systems

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)

Duration Calculus: A Formal Approach to Real-Time Systems (Monographs in Theoretical Computer Science. an Eatcs Seris)
Scheduling with timed automata

Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Task automata: Schedulability, decidability and undecidability

Information and Computation
A Temporal Logic for Multilevel Reasoning about Hardware

Computer
Optimal infinite scheduling for multi-priced timed automata

Formal Methods in System Design
Formal analysis of the priority ceiling protocol

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

Quantified Score

Hi-index	0.01

Visualization

Abstract

Traditionally many proofs in real time scheduling theory were informal and lacked the rigor usually required for good mathematical proofs. Some attempts have been made towards making the proofs more reliable, including using formal logics to specify scheduling algorithms and verify their properties. In particular, Duration Calculus, a real time interval temporal logic, has been used since timing requirements in scheduling can be naturally associated with intervals. This paper aims to improve the work in this area and give a summary. Static and dynamic priority scheduling algorithms are formalised in Duration Calculus and classical theorems for schedulability analysis are proven using the formal proof system of Duration Calculus.