Executing temporal logic programs
Executing temporal logic programs
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
Some Very Compositional Temporal Properties
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Gentzen-Systems for Propositional Temporal Logics
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Refining Interval Temporal Logic Specifications
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th 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
Reasoning about digital circuits
Reasoning about digital circuits
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
A Complete Axiomatization of Interval Temporal Logic with Infinite Time
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Interval Temporal Logic (ITL) is a formalism for reasoning about time periods. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to ω-regular expressions. We have developed a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by representing finite-state automata in ITL and then translating ITL formulas into them. Here we limit ourselves to finite time. The full paper (and another conference paper [15]) extends the approach to infinite time.