Expressiveness of Temporal Logics

A tree is as a partially ordered set of nodes s.t. the set of predecessors of any node is finite, totally ordered and with a common minimal element (the root ε). Let Σ be an alphabet. Definition A Σ-labeled tree is a pair 〈T , l〉 where: T is a tree l : T → Σ maps each node with a letter in Σ. Tree-like structure Definition A tree is a set T ⊆ N>0 such that if x · c ∈ T with x ∈ N>0 and c ∈ N>0, we have: x ∈ T for all 1 ≤ c ′ < c , x · c ′ ∈ T

[1]  D. Peled,et al.  Model Checking , 2018, Handbook of Finite State Based Models and Applications.

[2]  Nicolas Markey,et al.  On the Expressiveness and Complexity of ATL , 2007, FoSSaCS.

[3]  Joël Ouaknine,et al.  On Metric Temporal Logic and Faulty Turing Machines , 2006, FoSSaCS.

[4]  Valentin Goranko,et al.  Complete axiomatization and decidability of Alternating-time temporal logic , 2006, Theor. Comput. Sci..

[5]  Patricia Bouyer,et al.  On the Expressiveness of TPTL and MTL , 2005, FSTTCS.

[6]  Joël Ouaknine,et al.  On the decidability of metric temporal logic , 2005, 20th Annual IEEE Symposium on Logic in Computer Science (LICS' 05).

[7]  Philippe Schnoebelen,et al.  Temporal logic with forgettable past , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[8]  Paul Gastin,et al.  Fast LTL to Büchi Automata Translation , 2001, CAV.

[9]  Philippe Schnoebelen,et al.  Systems and Software Verification, Model-Checking Techniques and Tools , 2001 .

[10]  Neil Immerman,et al.  "An n! lower bound on formula size" , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.

[11]  Kousha Etessami,et al.  An Until Hierarchy and Other Applications of an Ehrenfeucht-Fraïssé Game for Temporal Logic , 2000, Inf. Comput..

[12]  Pierre Wolper,et al.  An automata-theoretic approach to branching-time model checking , 2000, JACM.

[13]  Thomas Wilke,et al.  CTL+ is Exponentially more Succinct than CTL , 1999, FSTTCS.

[14]  François Laroussinie,et al.  Specification in CTL+Past for Verification in CTL , 1999, Inf. Comput..

[15]  Thomas A. Henzinger,et al.  Alternating-time temporal logic , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[16]  Satoshi Yamane,et al.  The symbolic model-checking for real-time systems , 1996, Proceedings of the Eighth Euromicro Workshop on Real-Time Systems.

[17]  Philippe Schnoebelen,et al.  A Hierarchy of Temporal Logics with Past , 1995, Theor. Comput. Sci..

[18]  Joël Ouaknine,et al.  Model-Checking for Real-Time Systems , 1995, FCT.

[19]  Pierre Wolper,et al.  Reasoning About Infinite Computations , 1994, Inf. Comput..

[20]  Moshe Y. Vardi.  Nontraditional Applications of Automata Theory , 1994, TACS.

[21]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[22]  Colin Stirling,et al.  Modal and temporal logics , 1993, LICS 1993.

[23]  Thomas A. Henzinger,et al.  The benefits of relaxing punctuality , 1991, PODC '91.

[24]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[25]  Ron Koymans,et al.  Specifying real-time properties with metric temporal logic , 1990, Real-Time Systems.

[26]  Thomas A. Henzinger,et al.  Real-time logics: complexity and expressiveness , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[27]  Thomas A. Henzinger,et al.  A really temporal logic , 1989, 30th Annual Symposium on Foundations of Computer Science.

[28]  Dov M. Gabbay,et al.  The Declarative Past and Imperative Future: Executable Temporal Logic for Interactive Systems , 1987, Temporal Logic in Specification.

[29]  Joseph Y. Halpern,et al.  “Sometimes” and “not never” revisited: on branching versus linear time temporal logic , 1986, JACM.

[30]  Pierre Wolper,et al.  Reasoning about infinite computation paths , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[32]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

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

[34]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic , 2008, 25 Years of Model Checking.

[35]  Jean-François Raskin.  Logics, Automata and Classical Theories for Deciding Real Time , 1999 .

[36]  Gareth S. Rohde,et al.  Alternating automata and the temporal logic of ordinals , 1997 .

[37]  P. Øhrstrøm.  Temporal logic , 1995 .

[38]  D. Gabbay,et al.  Temporal Logic Mathematical Foundations and Computational Aspects , 1994 .

[39]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[40]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .