Temporal logic of programs
The existence of refinement mappings
Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Proceedings of the NATO Advanced Study Institute on Deductive program design
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A Stuttering Closed Temporal Logic for Modular Reasoning about Concurrent Programs
ICTL '94 Proceedings of the First International Conference on Temporal Logic
An Abstract Account of Composition
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Expressive Completeness of Temporal Logic of Action
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
An Axiomatization of Lamport's Temporal Logic of Actions
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Hybrid Systems
System Specification and Refinement in Temporal Logic
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
Invariance under stuttering in a temporal logic of actions
Theoretical Computer Science
Invariance Under Stuttering in a Temporal Logic without the "Until" Operator
Fundamenta Informaticae
| Hi-index | 0.00 |
This paper defines a generalization of Lamport's Temporal Logic of Actions. We prove that our logic is stuttering-invariant and give an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added.