Math 2.0

Computer science Semantics and logic in computer science Concept

Model checking

Summary

Model checking is the problem of deciding whether a finite model of a system satisfies a specification written in a temporal logic. The model is usually a finite Kripke structure, and the specification a formula of linear temporal logic, computation tree logic or the modal mu-calculus. It is a fully automatic method of verification: when the property fails, the algorithm can return a counterexample run.

Further reading

  1. Web https://en.wikipedia.org/wiki/Model_checking
About this page
TagVNY0VXVZ53
URIm2://VNY0VXVZ53
Kindconcept
WritingW0 stub
MSC68Q60, 03B44, 03B70
Same as
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Definitions