Editing Model-based testing (section)

===Theorem proving===
[[Theorem proving]] was originally used for automated proving of logical formulas. For model-based testing approaches, the system is modeled by a set of [[Predicate (logic)|predicates]], specifying the system's behavior.<ref name="otbt">{{Cite journal|first1=Achim D.|last1=Brucker|first2=Burkhart|last2=Wolff|title=On Theorem Prover-based Testing|journal=Formal Aspects of Computing|volume=25|issue=5|pages=683–721|year=2012|doi=10.1007/s00165-012-0222-y|url=http://www.brucker.ch/bibliography/abstract/brucker.ea-theorem-prover-2012.en.html|citeseerx=10.1.1.208.3135|s2cid=5774837}}</ref> To derive test cases, the model is partitioned into [[equivalence classes]] over the valid interpretation of the set of the predicates describing the system under test. Each class describes a certain system behavior, and, therefore, can serve as a test case. The simplest partitioning is with the disjunctive normal form approach wherein the logical expressions describing the system's behavior are transformed into the [[disjunctive normal form]].