Characteristic patterns for LTL

Authors:
Antonín Kučera;Jan Strejček
Affiliations:
Faculty of Informatics, Masaryk University, Brno, Czech Republic;Faculty of Informatics, Masaryk University, Brno, Czech Republic
Venue:
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Year:
2005

Citing 6
Cited 1

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
Verification of Infinite State Systems by Compositional Model Checking

CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
The Stuttering Principle Revisited: On the Expressiveness of Nested X and U Operators in the Logic LTL

CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Combining static analysis and case-based search space partitioning for reducing peak memory in model checking

Journal of Computer Science and Technology
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Classifying discrete temporal properties

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Deeper connections between LTL and alternating automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.