theory, algorithm, testing
To algorithmically check whether a program (the model) satisfies a specification.
The model is usually expressed as a directed graph consisting of nodes (or vertices) and edges. A set of atomic propositions is associated with each node. The nodes represents states of a program, the edges represent possible executions which alters the state, while the atomic propositions represent the basic properties that hold at a point of execution.
A specification language, usually some kind of temporal logic, is used to express properties.
The problem can be expressed mathematically as: given a temporal logic formula p and a model M with initial state s, decide if M,s \models p.
[“Automatic verification of finite state concurrent systems using temporal logic”, E.M. Clarke, E.A. Emerson, and A.P. Sisla, ACM Trans. on Programming Languages and Systems 8(2), pp. 244–263, 1986].
[mod-l] /ˈmɒd l/ noun 1. a standard or example for imitation or comparison. 2. a representation, generally in miniature, to show the construction or appearance of something. 3. an image in clay, wax, or the like, to be reproduced in more durable material. 4. a person or thing that serves as a subject for an […]
noun a small-scale model; also called modulet
- Model home
noun a representative house built and shown as advertisement for buyers to build similar homes; also called show house , spec house , [model unit]
[mod-l-ing] /ˈmɒd l ɪŋ/ noun 1. the act, art, or profession of a person who . 2. the process of producing sculptured form with some plastic material, as clay. 3. the technique of rendering the illusion of volume on a two-dimensional surface by shading. 4. the treatment of volume, as the turning of a form, […]