Skip to main content
SpringerLink
Log in

Verifying safety critical task scheduling systems in PPTL axiom system

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

This paper presents a case study of formal verification of safety critical task scheduling systems. First, a scheduling algorithm described in a temporal logic programming language is presented; then a sufficient and necessary condition for the schedulability of task set is formalized. Further, the correctness of the condition is proved by means of theorem proving in the axiom system of Propositional Projection Temporal Logic.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3

Similar content being viewed by others

References

  • Bertot Y, Castéran P (2004) Interactive theorem proving and program development. Springer-Verlag, Berlin, Heidelberg

  • Brock B, Kaufmann M, Moore J (1996) Acl2 theorems about commercial microprocessors. In: Srivas M, Camilleri A (eds) Proceedings of the 1st international conference on formal methods in computer-aided design. Springer-Verlag, London, pp 275–293

  • Duan Z (2005) Temporal logic and temporal logic programming. Science Press, Beijing

    Google Scholar 

  • Duan Z, Zhang N, Koutny M (2013) A complete proof system for propositional projection temporal logic. Theoret Comput Sci 497:84–107

    Article  MathSciNet  MATH  Google Scholar 

  • Gordon M, Melham T (1993) Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, Cambridge

  • Holzmann G (1997) The model checker spin. IEEE Trans Softw Eng 23(5):279–295

    Article  MathSciNet  Google Scholar 

  • McMillan K (1993) Symbolic model checking: an approach to the state explosion problem. Kluwer Academic, Dordrecht

    Book  Google Scholar 

  • Owre S, Rushby J (1992) Pvs: a prototype verification system. In: Kapur D (ed) Proceedings of the 11th international conference on automated deduction. Springer-Verlag, Heidelberg, pp 748–752

  • Paulson L (1994) Isabelle—a generic theorem prover. Springer, Berlin

    MATH  Google Scholar 

  • Sistla A (1983) Theoretical issues in the design and verification of distributed systems. PhD thesis, Harvard University

  • Tian C, Duan Z (2009) Complexity of propositional projection temporal logic with star. Math Str Comput Sci 19(1):73–100

    Article  MathSciNet  MATH  Google Scholar 

  • Vardi M (1988) A temporal fixpoint calculus. In: POPL ’88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM, New York, pp 250–259

  • Wolper P (1983) Temporal logic can be more expressive. Info Control 56:72–99

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

This research is supported by the National Program on Key Basic Research Project of China (973 Program) Grant No. 2010CB328102, National Natural Science Foundation of China under Grant Nos. 91118007, 61133001, 61202038.

Author information

Authors and Affiliations

  1. Institute of Computing Theory and Technology and ISN Lab, Xidian University, Xi’an, 710071, China

    Nan Zhang, Zhenhua Duan & Cong Tian

  2. China Academy of Space Technology, Beijing, 100094, China

    Mengfei Yang & Bin Gu

Authors
  1. Nan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mengfei Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bin Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Zhenhua Duan
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Cong Tian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zhenhua Duan.

Appendix: Axiom system of PPTL

Appendix: Axiom system of PPTL

Axioms:

figure aa

Inference Rules:

figure ab

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, N., Yang, M., Gu, B. et al. Verifying safety critical task scheduling systems in PPTL axiom system. J Comb Optim 31, 577–603 (2016). https://doi.org/10.1007/s10878-014-9776-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9776-3

Keywords

Search

Navigation