Characteristic Patterns for LTL

We give a new characterization of those languages that are definable in fragments of LTL where the nesting depths of X and U modalities are bounded by given constants. This brings further results about various LTL fragments. We also propose a generic method for decomposing LTL formulae into an equivalent disjunction of “semantically refined” LTL formulae, and indicate how this result can be used to improve the functionality of existing LTL model-checkers.

[1]  W. Thomas.  Star-Free Regular Sets of ~o-Sequences , 2004 .

[2]  Wolfgang Thomas,et al.  Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics , 1990 .

[3]  Kousha Etessami,et al.  An Until hierarchy for temporal logic , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

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

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

[6]  Thomas Wilke,et al.  Temporal Logic and Semidirect Products: An Effective Characterization of the Until Hierarchy , 2001, SIAM J. Comput..

[7]  Dominique Perrin,et al.  Recent Results on Automata and Infinite Words , 1984, MFCS.

[8]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[9]  Jan Strejÿ.  Characteristic Patterns for LTL , 2005 .

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

[11]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[12]  张文辉.  Combining Static Analysis and Case-Based Search Space Partitioning for Reducing Peak Memory in Model Checking , 2003 .

[13]  Kenneth L. McMillan,et al.  Verification of Infinite State Systems by Compositional Model Checking , 1999, CHARME.

[14]  Antonín Kucera,et al.  The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL , 2002, CSL.

[15]  Thomas Wilke,et al.  Classifying Discrete Temporal Properties , 1999, STACS.

[16]  Cnrs Fre,et al.  Model Checking a Path (Preliminary Report) , 2003 .

[17]  Philippe Schnoebelen,et al.  Model Checking a Path , 2003, CONCUR.