A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata

  • Authors:
  • Klaus Schneider;Dirk W. Hoffmann

  • Affiliations:
  • -;-

  • Venue:
  • TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an embedding of linear time temporal logic LTL in HOL together with an elegant translation of LTL formulas into equivalent ω-automata. The translation is completely implemented by HOL rules and is therefore safe. Its implementation is mainly based on preproven theorems such that the conversion works very efficiently. In particular, it runs in linear time in terms of the given formula. The main application of this conversion is the sound integration of symbolic model checkers as (unsafe) decision procedures in the HOL theorem prover. On the other hand, the conversion also enables HOL users to directly verify temporal properties by means of HOL's induction rules.