Streett acceptance condition
GPTKB entity
Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
automata acceptance condition
|
| gptkbp:describes |
infinite runs
|
| gptkbp:formalDefinition |
A run is accepting if for every pair (E_i, F_i), if E_i is visited infinitely often, then F_i is also visited infinitely often.
|
| https://www.w3.org/2000/01/rdf-schema#label |
Streett acceptance condition
|
| gptkbp:introducedIn |
1982
|
| gptkbp:namedAfter |
Robert Streett
|
| gptkbp:relatedTo |
gptkb:Rabin_acceptance_condition
gptkb:Muller_acceptance_condition parity acceptance condition |
| gptkbp:usedIn |
gptkb:Büchi_automaton
automata theory ω-automata |
| gptkbp:bfsParent |
gptkb:Rabin_acceptance_condition
gptkb:Büchi_acceptance_condition |
| gptkbp:bfsLayer |
7
|