Model checking (source code)

= Model checking
{wiki}

<Model checking> verifies whether a formally represented system satisfies a specified property, often a <temporal logic> formula over a finite transition system. A safety question asks whether a bad state is reachable; exhaustive state exploration can either find a counterexample path or establish its absence in the model. <Symbolic model checking> represents <sets> of states compactly, while bounded methods search executions up to a chosen horizon. Verification is relative to the model and assumptions: a missing physical behaviour is not ruled out merely because it was omitted from the transition relation.https://www.cs.cmu.edu/~modelcheck/[CMU model-checking group, finite-state verification and temporal specifications]{ref}