We survey principles of model checking techniques for the automatic analysis of reactive
systems. The use of model checking is exemplified by an analysis of the Needham …

We describe an automata-theoretic approach to the automatic verification of finite-state
programs. The basic idea underlying this approach is that for any temporal formula we can …

Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

A comprehensive introduction to the foundations of model checking, a fully automated
technique for finding flaws in hardware and software; with extensive examples and both …

Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal
quantification over all paths that are generated by the execution of a system; branching-time …

We describe finite-state programs over real-numbered time in a guarded-command
language with real-valued clocks or, equivalently, as finite automata with real-valued clocks …

We present algorithms for computing similarity relations of labeled graphs. Similarity
relations have applications for the refinement and verification of reactive systems. For finite …

Translating linear temporal logic formulas to automata has proven to be an effective
approach for implementing linear-time model-checking, and for obtaining many extensions …

The Μ-calculus can be viewed as essentially the “ultimate” program logic, as it expressively
subsumes all propositional program logics, including dynamic logics, process logics, and …

Temporal logic comes in two varieties: linear-time temporal logic assumes implicit universal
quantification over all paths that are generated by system moves; branching-time temporal …