Skip to main content
. 2021 Apr 19;7:e436. doi: 10.7717/peerj-cs.436

Algorithm 4. Equivalence query EQ(H, M).

Input: a hypothesis H and an abstract model M
Output: a counterexample if HM , otherwise null
1: while true do
2:   find a word w that separates H and M
3:   if w does not exist then
4:    return null
5:   end if
6:   if M .isAccepted(w) = MQ(w) then
7:    return w
8:   end if
9:   refine M with (w, MQ(w))
10: end while