IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v31y2016i2d10.1007_s10878-014-9776-3.html
   My bibliography  Save this article

Verifying safety critical task scheduling systems in PPTL axiom system

Author

Listed:
  • Nan Zhang

    (Xidian University)

  • Mengfei Yang

    (China Academy of Space Technology)

  • Bin Gu

    (China Academy of Space Technology)

  • Zhenhua Duan

    (Xidian University)

  • Cong Tian

    (Xidian University)

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.

Suggested Citation

  • Nan Zhang & Mengfei Yang & Bin Gu & Zhenhua Duan & Cong Tian, 2016. "Verifying safety critical task scheduling systems in PPTL axiom system," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 577-603, February.
    • Handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9776-3
    DOI: 10.1007/s10878-014-9776-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-014-9776-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-014-9776-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kai Yang & Cong Tian & Nan Zhang & Zhenhua Duan & Hongwei Du, 2019. "A temporal logic programming approach to planning," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 402-420, August.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:31:y:2016:i:2:d:10.1007_s10878-014-9776-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.