Invariance under stuttering in a temporal logic of actions

Authors:
Michael Kaminski
Affiliations:
Department of Computer Science, Technion---Israel Institute of Technology, Haifa 32000, Israel
Venue:
Theoretical Computer Science
Year:
2006

Citing 7
Cited 2

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 existence of refinement mappings

Theoretical Computer Science
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
An Until hierarchy and other applications of an Ehrenfeucht-Fraïssé game for temporal logic

Information and Computation - Special issue: LICS 1996—Part 1
A More Complete TLA

FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II

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

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

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

Abstract

We show that some simple and useful stutter-invariant properties definable in the language of Lamport's Simple Temporal Logic of Actions (STLA) are not definable in STLA and present a natural extension of STLA that allows one to express all stutter-invariant properties definable in the language of STLA.