Theoretical Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
The power of the “always“ operator in first-order temporal logic
Theoretical Computer Science
On translations of temporal logic of actions into monadic second-order logic
Theoretical 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
STeP: Deductive-Algorithmic Verification of Reactive and Real-Time Systems
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Hi-index | 0.00 |
It is shown that the satisfiability/validity questions in Temporal Logic of Actions can be translated into satisfiability/validity questions in Second Order Temporal Logic and vice versa. The translation from Second Order Temporal Logic into Temporal Logic of Actions is linear and the translation from Temporal Logic of Actions into Second Order Temporal Logic is quadratic.