Invariance Under Stuttering in a Temporal Logic without the "Until" Operator

Authors:
Michael Kaminski
Affiliations:
Department of Computer Science, Technion - Israel Institute of Technology, Haifa 32000, Israel. E-mail: kaminski@cs.technion.ac.il
Venue:
Fundamenta Informaticae
Year:
2008

Citing 8
Cited 0

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
An axiomatization of Lamport's temporal logic of actions

CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The temporal logic of actions

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Model checking

Model checking
A More Complete TLA

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
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
Invariance under stuttering in a temporal logic of actions

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We show that a stutter-invariant property is expressible in propositional temporal logic without the "until" operator if and only if it is expressible in the Generalized Temporal Logic of Actions.