论文信息 - A Decision Method for Temporal Logic Based on Resolution

A Decision Method for Temporal Logic Based on Resolution

A decision method for linear temporal logic is presented. The given temporal formula is first converted into a normal form formula containing restricted nesting of temporal operators. The resulting formula is tested for satisfiability by using four crucial operations — Unwinding Resolution, SKIP and deletion of persistent eventual terms.

G. Venkatesh | G. Venkatesh

[1] Robert S. Boyer,et al. The Correctness Problem in Computer Science , 1982 .

[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3] Richard C. T. Lee,et al. Symbolic logic and mechanical theorem proving , 1973, Computer science classics.

[4] Ana R. Cavalli,et al. A Decision Method for Linear Temporal Logic , 1984, CADE.

[5] Zohar Manna,et al. Verification of concurrent programs, Part I: The temporal framework , 1981 .

[6] A. Prasad Sistla,et al. The complexity of propositional linear temporal logics , 1982, STOC '82.

[7] Pierre Wolper. Temporal Logic Can Be More Expressive , 1983, Inf. Control..