*This article describes Kripke structures as used in model checking. For a more general description, see Kripke semantics*.

A **Kripke structure** is a variation of the transition system, originally proposed by Saul Kripke,^{[1]} used in model checking^{[2]} to represent the behavior of a system.
It is basically a graph whose nodes represent the reachable states of the system and whose edges represent state transitions. A labelling function maps each node to a set of properties that hold in the corresponding state. Temporal logics are traditionally interpreted in terms of Kripke structures.

Let *AP* be a set of *atomic propositions*, i.e. boolean expressions over variables, constants and predicate symbols. Clarke et al.^{[3]} define a Kripke structure over *AP* as a 4-tuple *M* = (*S*, *I*, *R*, *L*) consisting of

- a finite set of states
*S*. - a set of initial states
*I*⊆*S*. - a transition relation
*R*⊆*S*×*S*such that*R*is left-total, i.e., ∀s ∈*S*∃s' ∈*S*such that (s,s') ∈*R*. - a labeling (or
*interpretation*) function*L*:*S*→ 2^{AP}.

Since *R* is left-total, it is always possible to construct an infinite path through the Kripke structure. A deadlock state can be modeled by a single outgoing edge back to itself.
The labeling function *L* defines for each state *s* ∈ *S* the set *L*(*s*) of all atomic propositions that are valid in *s*.

A *path* of the structure *M* is a sequence of states ρ = s_{1},s_{2},s_{3},... such that for each i > 0, *R*(s_{i}, s_{i+1}) holds.
The *word* on the path ρ is a sequence of sets of the atomic propositions
*w*=*L*(s_{1}),*L*(s_{2}),*L*(s_{3}),...,
which is an ω-word over alphabet 2^{AP}.

With this definition, a Kripke structure (say, having only one initial state *i∈I*) may be identified with a Moore machine with a singleton input alphabet, and with the output function being its labeling function.^{[4]}

Let the set of atomic propositions *AP* = {p,q}.
p and q can model arbitrary boolean properties of the system that the Kripke structure is
modelling.

The figure at right illustrates a Kripke structure *M* = (*S*, *I*, *R*, *L*),
where

*S*= {s_{1},s_{2},s_{3}}.*I*= {s_{1}}.*R*= {(s_{1},s_{2}),(s_{2},s_{1})(s_{2},s_{3}),(s_{3},s_{3})}.*L*= {(s_{1}, {p,q}), (s_{2}, {q}), (s_{3}, {p})}.

*M* may produce a path ρ = s_{1},s_{2},s_{1},s_{2},s_{3},s_{3},s_{3},... and *w* = {p,q},{q},{p,q},{q},{p},{p},{p},... is the execution word over the path ρ.
*M* can produce execution words belonging to the language ({p,q}{q})*({p})^{ω}∪({p,q}{q})^{ω}.

Although this terminology is widespread in the model checking community, some textbooks on model checking do not define "Kripke structure" in this extended way (or at all in fact), but simply use the concept of a (labelled) transition system, which additionally has a set *Act* of actions, and the transition relation is defined as a subset of *S* × *Act* × *S*, which they additionally extend to include a set of atomic propositions and a labeling function for the states as well (*L* as defined above.) In this approach, the binary relation obtained by abstracting away the action labels is called a **state graph**.^{[5]}

Clarke et al. redefine a Kripke structure as a set of transitions (instead of just one), which is equivalent to the labeled transitions above, when they define the semantics of modal μ-calculus.^{[6]}

**^**Kripke, Saul, 1963, “Semantical Considerations on Modal Logic,” Acta Philosophica Fennica, 16: 83-94**^**Clarke, Edmund M. (2008): The Birth of Model Checking. in: Grumberg, Orna and Veith, Helmut eds.: 25 Years of Model Checking, Vol. 5000: Lecture Notes in Computer Science. Springer Berlin Heidelberg, p. 1-26.**^**Clarke, Grumberg and Peled: "Model Checking", page 14. The MIT Press, 1999.**^**Klaus Schneider (2004).*Verification of reactive systems: formal methods and algorithms*. Springer. p. 45. ISBN 978-3-540-00296-3.**^**Christel Baier; Joost-Pieter Katoen.*Principles of model checking*. The MIT Press. pp. 20–21 and 94–95. ISBN 978-0-262-02649-9.**^**Clarke et al. p. 98

This page is based on a Wikipedia article written by authors
(here).

Text is available under the CC BY-SA 3.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.