Axioms for obligation and robustness with temporal logic

Tim French, John Mccabe-Dansted, Mark Reynolds

    Research output: Chapter in Book/Conference paperConference paperpeer-review

    1 Citation (Scopus)

    Abstract

    RoCTL* was proposed to model and specify the robustness of reactive systems. RoCTL* extended CTL* with the addition of Obligatory and Robustly operators, which quantify over failure-free paths and paths with one more failure respectively. This paper gives an axiomatisation for all the operators of RoCTL* with the exception of the Until operator; this fragment is able to express similar contrary-to-duty obligations to the full RoCTL* logic. We call this formal system NORA, and give a completeness proof. We also consider the fragments of the language containing only path quantifiers (but where variables are dependent on histories). We examine semantic properties and potential axiomatisations for these fragments.
    Original languageEnglish
    Title of host publicationDeontic Logic in Computer Science
    Subtitle of host publication10th International Conference, DEON 2010, Fiesole, Italy, July 7-9, 2010. Proceedings
    Place of PublicationUSA
    PublisherSpringer
    Pages66 - 83
    ISBN (Electronic)978-3-642-14183-6
    ISBN (Print)978-3-642-14182-9
    DOIs
    Publication statusPublished - 2010
    Event10th International Conference on Deontic Logic in Computer Science - Fiesole, Italy
    Duration: 7 Jul 20109 Jul 2010

    Publication series

    NameLecture Notes in Computer Science
    Volume6181

    Conference

    Conference10th International Conference on Deontic Logic in Computer Science
    Abbreviated titleDEON 2010
    Country/TerritoryItaly
    CityFiesole
    Period7/07/109/07/10

    Fingerprint

    Dive into the research topics of 'Axioms for obligation and robustness with temporal logic'. Together they form a unique fingerprint.

    Cite this