Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
ACM Transactions on Programming Languages and Systems (TOPLAS)
Stutter-invariant temporal properties are expressible without the next-time operator
Information Processing Letters
Model checking
An Axiomatization of Lamport's Temporal Logic of Actions
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
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
Hi-index | 0.00 |
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.