A Decision Procedure and Complete Axiomatization of Finite Interval Temporal Logic with Projection

2003 ◽  
Vol 13 (2) ◽  
pp. 195-239 ◽  
Author(s):  
H. Bowman
Keyword(s):  
Temporal Logic ◽  
Decision Procedure ◽  
Finite Interval ◽  
Interval Temporal Logic ◽  
Complete Axiomatization

A decision procedure and complete axiomatization for projection temporal logic

2020 ◽  
Vol 819 ◽  
pp. 50-84 ◽  
Author(s):  
Xinfeng Shu ◽  
Zhenhua Duan ◽  
Hongwei Du
Keyword(s):  
Temporal Logic ◽  
Decision Procedure ◽  
Complete Axiomatization

An Automata-Theoretic Decision Procedure for Propositional Temporal Logic with Since and Until1

1992 ◽  
Vol 17 (3) ◽  
pp. 271-282
Author(s):  
Y.S. Ramakrishna ◽  
L.E. Moser ◽  
L.K. Dillon ◽  
P.M. Melliar-Smith ◽  
G. Kutty
Keyword(s):  
Temporal Logic ◽  
Decision Procedure ◽  
Linear Time ◽  
Computer Systems ◽  
Hierarchical Abstraction ◽  
Soundness And Completeness

We present an automata-theoretic decision procedure for Since/Until Temporal Logic (SUTL), a linear-time propositional temporal logic with strong non-strict since and until operators. The logic, which is intended for specifying and reasoning about computer systems, employs neither next nor previous operators. Such operators obstruct the use of hierarchical abstraction and refinement and make reasoning about concurrency difficult. A proof of the soundness and completeness of the decision procedure is given, and its complexity is analyzed.

scholarly journals Prompt Interval Temporal Logic

2016 ◽  
pp. 207-222 ◽  
Author(s):  
Dario Della Monica ◽  
Angelo Montanari ◽  
Aniello Murano ◽  
Pietro Sala
Keyword(s):  
Temporal Logic ◽  
Interval Temporal Logic
Sign in / Sign up

Export Citation Format

Share Document