Library

DBA · Deterministic Büchi

At most two requests, ever

Bounded existence, in Dwyer’s catalogue of specification patterns: r may happen, but no more than twice in the whole infinite run. A safety property, so every state accepts and a third r is simply a missing edge.

noneonetwonrnrn
The machine as drawn — 3 states, 5 transitions.

The author’s examples, run

(n) → accept(nn) → accept(nnn) → acceptnnn(n) → accept(r) → reject(nr) → reject(rn) → reject(rr) → reject