BibTeX
@MISC{Hazelhurst99generalisedunification,
author = {Scott Hazelhurst},
title = {Generalised Unification of Temporal Logic Formulas},
year = {1999}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Given two temporal logic formulas, g and h, we wish to know whether there is a modification, m, we can make to h so that g =) h. This problem has important applications in hardware verification, where finding such modifications efficiently is important for an inferencing system. The temporal logic used, TL, is a relatively simple logic which is interpreted over finite state machine models. The modifications allowed are `time-shifting' (nesting under the next-time temporal operator) and substitution of expressions for variables. An algorithm has been developed and implemented in the Voss verification system. The basis of the algorithm is to use a relatively compact, normalised representation of the formulas, which converts the problem into a generalised string matching problem. Some experimental results have been obtained from the use of the algorithm in practice. Keywords: unification, temporal logic, pattern matching CR Categories: F2.2, F4.1, F4.2, I2.4 1 INTRODUCTION Informally t...
Keyphrases
temporal logic formula temporal logic generalised string matching problem hardware verification next-time temporal operator finite state machine model voss verification system normalised representation cr category simple logic inferencing system experimental result important application introduction informally
