17 Automata-theoretic techniques for temporal reasoning (original) (raw)

This chapter presents an automata-theoretic approach for temporal reasoning, focusing on the construction of finite-state automata that represent the computations satisfying temporal formulas. It distinguishes between linear and branching temporal logics, detailing how automata on infinite structures facilitate algorithmic methods for verifying these logics. The connection between temporal logics and automata is leveraged to reduce decision problems like satisfiability and model checking to established automatatheoretic issues, resulting in optimal algorithms for program verification.