CTL-Like Fragments of a Temporal Logic of Robustness

The logic RoCTL* is an extension of the branching time temporal logic CTL* to represent robustness of systems to transient failures such as loss of data packets. New operators are introduced dealing with obligation (where no failures occur) and robustness (where at most one additional failure occurs). The only known decision procedures for the temporal logic of robustness RoCTL* are non-elementary. Here we propose two CTL-like restrictions of RoCTL*, Pair-RoCTL and State-RoCTL. We investigate whether it is possible to translate these fragments into CTL showing whilst this is not in general possible for Pair-RoCTL it is for State-RoCTL. We obtain a satisfiability preserving translation for State-RoCTL into CTL showing that the complexity of satisfiability of State-RoCTL is EXPTIME-complete. We also show that these fragments of RoCTL* are useful in specifying systems.

[1]  James William Forrester,et al.  Gentle Murder, or the Adverbial Samaritan , 1984 .

[2]  Edmund M. Clarke,et al.  Using Branching Time Temporal Logic to Synthesize Synchronization Skeletons , 1982, Sci. Comput. Program..

[3]  Clare Dixon,et al.  A Refined Resolution Calculus for CTL , 2009, CADE.

[4]  E. Allen Emerson,et al.  The Complexity of Tree Automata and Logics of Programs , 1999, SIAM J. Comput..

[5]  Jai Srinivasan,et al.  Branching time temporal logic , 1988, REX Workshop.

[6]  Moshe Y. Vardi.  Sometimes and Not Never Re-revisited: On Branching Versus Linear Time , 1998, CONCUR.

[7]  Mark Reynolds,et al.  Towards a CTL* Tableau , 2005, FSTTCS.

[8]  Frank Dignum,et al.  Designing a Deontic Logic of Deadlines , 2004, DEON.

[9]  Larry J. Stockmeyer,et al.  Improved upper and lower bounds for modal logics of programs , 1985, STOC '85.

[10]  Rajeev Goré,et al.  One-Pass Tableaux for Computation Tree Logic , 2007, LPAR.

[11]  Alexander Bolotov.  Clausal resolution for branching-time temporal logic , 2000 .

[12]  John Christopher McCabe-Dansted.  A Tableau for RoBCTL* , 2008, JELIA.

[13]  Rajeev Goré,et al.  The Tableaux Work Bench , 2003, TABLEAUX.

[14]  Joseph Y. Halpern,et al.  "Sometimes" and "not never" revisited: on branching versus linear time (preliminary report) , 1983, POPL '83.

[15]  Sophie Pinchinat,et al.  On the Expressivity of RoCTL* , 2009, 2009 16th International Symposium on Temporal Representation and Reasoning.

[16]  Mark Reynolds,et al.  A Tableau for Bundled CTL , 2006, J. Log. Comput..

[17]  Clare Dixon,et al.  Resolution for a Temporal Logic of Robustness ( Extended Version ) , 2008 .

[18]  Saharon Shelah,et al.  On the temporal analysis of fairness , 1980, POPL '80.

[19]  Tim French,et al.  A Temporal Logic of Robustness , 2007, FroCoS.

[20]  Joseph Y. Halpern,et al.  Decision procedures and expressiveness in the temporal logic of branching time , 1982, STOC '82.

[21]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.