| Model Checking |
Article Index for Model |
Website Links For Model |
Information AboutModel Checking |
| CATEGORIES ABOUT MODEL CHECKING | |
| formal methods | |
| logic in computer science | |
| model theory | |
| model checkers | |
|
The model is usually expressed as a transition system, i.e Directed Graph consisting of nodes (or Vertices ) and Edges . A set of Atomic Proposition s is associated with each node. The nodes represent states of a system, the edges represent possible Execution s which alters the state, while the atomic Proposition s represent the basic properties that hold at a point of execution. Formally, the problem can be stated as follows: given a desired property, expressed as a temporal logic formula p, and a model M with initial state s, decide if . Model checking tools face a combinatorial blow up of the state-space, commonly known as the State Explosion Problem . Researchers have developed Symbolic Algorithm s, Partial Order Reduction , Abstraction and On The Fly Model Checking in order to cope with this problem. These tools were initially developed to reason about the logical correctness of Discrete State systems, but have since been extended to deal with Real-time and limited forms of Hybrid System s. SEE ALSO Articles
Related techniques Research groups
Model checking tools
REFERENCES
|
|
|