Method
Model checking
Overview
In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification (also known as correctness). This is typically associated with hardware or software systems, where the specification contains liveness requirements (such as avoidance of livelock) as well as safety requirements (such as avoidance of states representing a system crash).
In order to solve such a problem algorithmically, both the model of the system and its specification are formulated in some precise mathematical language. To this end, the problem is formulated as a task in logic, namely to check whether a structure satisfies a given logical formula. This general concept applies to many kinds of logic and many kinds of structures. A simple model-checking problem consists of verifying whether a formula in the propositional logic is satisfied by a given structure.
Overview adapted from Wikipedia (CC BY-SA 4.0; see the article history for authors).
Possible passages
Found by search and not yet checked by a person; they may only mention the idea in passing.
Any such select set is called the set of postulates, or premises, from which the reasoning proceeds. The reasoning is nothing else than the exhibition of the whole pattern of general conditions involved in the pattern derived from the selected postulates.
Alfred North Whitehead, Science and the modern world
States what Model checking is.
The particular habit of mind which governs this or that inference may be formulated in a proposition whose truth depends on the validity of the inferences which the habit determines; and such a formula is called a _guiding principle_ of inference. Suppose, for example, that we observe that a rotating disk of copper quickly comes to rest when placed between the poles of a magnet, and we infer that this will happen…
Charles S. Peirce, Chance, Love, and Logic
States what Model checking is.
We can also, however, make a positive use of this principle, that is, not merely to banish falsehood and error (in so far as it rests upon contradiction), but also for the cognition of truth. For if the judgement is analytical, be it affirmative or negative, its truth must always be recognizable by means of the principle of contradiction. For the contrary of that which lies and is cogitated as conception in the…
Immanuel Kant, The Critique of Pure Reason
States what Model checking is.
Related ideas
- First-order logic
- Artificial intelligence
- Counterexample
- Computability theory
- Propositional logic
- Temporal logic
- Structure (mathematical logic)
- Logic
- Computer science
- Linear temporal logic
- Computational complexity theory
- Algorithm
- Decision problem
- Formal specification
Place in the tradition
Part of First-order logic.