This HTML5 document contains 28 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n8https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
dbpedia-fahttp://fa.dbpedia.org/resource/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
goldhttp://purl.org/linguistics/gold/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Generalized_Büchi_automaton
rdfs:label
Generalized Büchi automaton
rdfs:comment
In automata theory, a generalized Büchi automaton is a variant of a Büchi automaton. The difference with the Büchi automaton is the accepting condition, which is determined by 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 are equivalent in expressive power to Büchi automata; a transformation is given here.
dcterms:subject
dbc:Model_checking dbc:Automata_(computation)
dbo:wikiPageID
28726554
dbo:wikiPageRevisionID
1101127062
dbo:wikiPageWikiLink
dbr:Ω-language dbc:Automata_(computation) dbc:Model_checking dbr:Büchi_automata dbr:Ω-automaton dbr:Automata_theory dbr:Finite_set dbr:Büchi_automaton dbr:Model_checking dbr:Formal_verification dbr:Linear_temporal_logic dbr:Linear_temporal_logic_to_Büchi_automaton
owl:sameAs
dbpedia-fa:ماشین_بوخی_توسعه_یافته wikidata:Q5532429 n8:4kbRz freebase:m.0cz8rz5
dbp:wikiPageUsesTemplate
dbt:Reflist
dbo:abstract
In automata theory, a generalized Büchi automaton is a variant of a Büchi automaton. The difference with the Büchi automaton is the accepting condition, which is determined by 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 are equivalent in expressive power to 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 desired program property. There are algorithms that translate a LTL formulainto a generalized Büchi automaton.for this purpose. The notion of generalized Büchi automaton was introduced specifically for this translation.
gold:hypernym
dbr:Variant
prov:wasDerivedFrom
wikipedia-en:Generalized_Büchi_automaton?oldid=1101127062&ns=0
dbo:wikiPageLength
4874
foaf:isPrimaryTopicOf
wikipedia-en:Generalized_Büchi_automaton