A note on stutter-invariant PLTL

Authors:
Cong Tian;Zhenhua Duan
Affiliations:
Institute of Computing Theory and Technology, Xidian University, Xi'an 710071, PR China;Institute of Computing Theory and Technology, Xidian University, Xi'an 710071, PR China
Venue:
Information Processing Letters
Year:
2009

Citing 7
Cited 0

Temporal and modal logic

Handbook of theoretical computer science (vol. B)
The Model Checker SPIN

IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
A note on a question of Peled and Wilke regarding stutter-invariant LTL

Information Processing Letters
A decision procedure for propositional projection temporal logic with infinite models

Acta Informatica
The temporal logic of programs

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Complexity of propositional projection temporal logic with star†

Mathematical Structures in Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

Peled and Wilke proved that every stutter-invariant propositional linear temporal property is expressible in Propositional Linear Temporal Logic (PLTL) without @? (next) operators. To eliminate next operators, a translation @t which converts a stutter-invariant PLTL formula @f to an equivalent formula @t(@f) not containing @? operators has been given. By @t, for any formula @?@f, where @f contains no @? operators, a formula with the length of O(4^n|@f|) is always produced, where n is the number of distinct propositions in @f, and |@f| is the number of symbols appearing in @f. Etessami presented an improved translation @t^'. By @t^', for @?@f, a formula with the length of O(nx2^n|@f|) is always produced. We further improve Etessami's result in the worst case to O(nx2^n|@f|) by providing a new translation @t^'', and we show that the worst case will never occur.