A formal proof of the deadline driven scheduler in PPTL axiomatic system

作者：Zhang, Nan; Duan, Zhenhua^*; Tian, Cong; Du, Dingzhu

来源：Theoretical Computer Science, 2014, 554: 229-253.

DOI：10.1016/j.tcs.2013.12.014

• Theorem proving
• Projection temporal logic
• Deadline driven scheduler
• Real-time

This paper presents an approach for verifying the correctness of the feasibility theorem on the deadline driven scheduler (DDS) with the axiom system of Propositional Projection Temporal Logic (PPTL). To do so, the deadline driven scheduling algorithm is modeled by an MSVL (Modeling, Simulation and Verification Language) program and the feasibility theorem is formulated by PPTL formulas with two parts: a necessary part and a sufficient part. Then, several lemmas are abstracted and proved by means of the axiom system of PPTL. With the help of the lemmas, two parts of the theorem are deduced respectively. This case study convinces us that some real-time properties of systems can be formally verified by theorem proving using the axiom system of PPTL.

• 出版日期2014-10-16
• 单位西安电子科技大学