AUTOMATA-THEORETIC APPROACH TO AUTOMATIC PROGRAM VERIFICATION.

Abstract

An automata-theoretic approach to automatic verification of concurrent finite-state programs by model checking is described. The basic idea underlying this approach is that for any temporal formula we can construct an automation that accepts precisely the computations that satisfy the formula. The model-checking algorithm that results from this approach is much simpler and cleaner than tableau-based algorithms. This approach is used to extend model checking to probabilistic concurrent finite-state programs.