Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Generalized_Büchi_automaton> ?p ?o. }
Showing items 1 to 11 of
11
with 100 items per page.
- Generalized_Büchi_automaton abstract "In automata theory, generalized Büchi automaton (GBA) is a variant of Büchi automaton. The difference with the Büchi automaton is its accepting condition, i.e., a set of sets of states. A run is accepted by the automaton if it visits at least one state of every set of the accepting condition infinitely often. Generalized büchi automata (GBA) is equivalent in expressive power with Büchi automata; a transformation is given here. In formal verification,the model checking method needs to obtain an automaton from a LTL formula that specifies the program property. There are algorithms that translate a LTL formulainto a GBAfor this purpose.The notion of GBA was introduced specifically for this translation.".
- Generalized_Büchi_automaton wikiPageID "28726554".
- Generalized_Büchi_automaton wikiPageRevisionID "533122293".
- Generalized_Büchi_automaton subject Category:Automata_theory.
- Generalized_Büchi_automaton subject Category:Model_checking.
- Generalized_Büchi_automaton comment "In automata theory, generalized Büchi automaton (GBA) is a variant of Büchi automaton. The difference with the Büchi automaton is its accepting condition, i.e., a set of sets of states. A run is accepted by the automaton if it visits at least one state of every set of the accepting condition infinitely often. Generalized büchi automata (GBA) is equivalent in expressive power with Büchi automata; a transformation is given here.".
- Generalized_Büchi_automaton label "Generalized Büchi automaton".
- Generalized_Büchi_automaton sameAs Generalized_B%C3%BCchi_automaton.
- Generalized_Büchi_automaton sameAs Q5532429.
- Generalized_Büchi_automaton sameAs Q5532429.
- Generalized_Büchi_automaton wasDerivedFrom Generalized_Büchi_automaton?oldid=533122293.