(algorithm)
Definition: Efficiently deciding whether a temporal logic formula is satisfied in a finite state machine model.
See also Kripke structure, BDD.
Note: Model checking is increasingly used in the formal verification of hardware and software. The decision process often uses some form of binary decision diagram (BDD).
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Mon May 11 15:07:57 2026.
Cite this as:
Sandeep Kumar Shukla, "model checking", in
Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 17 December 2004. (accessed TODAY)
Available from: /HTML/modelcheckng.html