Completeness of temporal logics over infinite intervals

Authors:
Hanpin Wang;Qiwen Xu
Affiliations:
Department of Computer Science & Technology, Peking University, Beijing 100871, China;Faculty of Science and Technology, University of Macau, Macau SAR, China
Venue:
Discrete Applied Mathematics - Discrete mathematics and theoretical computer science (DMTCS)
Year:
2004

Citing 5
Cited 3

The temporal logic of reactive and concurrent systems

The temporal logic of reactive and concurrent systems
Liveness and Fairness in Duration Calculus

CONCUR '94 Proceedings of the Concurrency Theory
Toward a theory of sequential hybrid programs

PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Complete Proof Systems for First Order Interval Temporal Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional reasoning about projected and infinite time

ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems

Complexity of propositional projection temporal logic with star†

Mathematical Structures in Computer Science
Decidability of propositional projection temporal logic with infinite models

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Reasoning about QoS Contracts in the Probabilistic Duration Calculus

Electronic Notes in Theoretical Computer Science (ENTCS)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Interval temporal logics over infinite intervals are studied. First, the ordinary possible worlds models are extended to infinite possible world models. Accordingly, an axiomatic system is proposed and it has been proved complete. Secondly, infinite intervals are included in a logic over abstract intervals. A corresponding axiomatic system is given and proven to be complete also.