Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q6553530> ?p ?o }
Showing triples 1 to 19 of
19
with 100 triples per page.
- Q6553530 subject Q7036095.
- Q6553530 subject Q8637035.
- Q6553530 subject Q8842299.
- Q6553530 abstract "In formal verification,finite state model checking needs to compute an equivalent Büchi automaton (BA) to a Linear temporal logic (LTL) formula,i.e., the LTL formula and the BA recognizes the same ω-language.There are algorithms that translate an LTL formula to an equivalent BA. This transformation is normally done in two steps.The first step produces a generalized Büchi automaton(GBA) from a LTL formula.The second step translates this GBA into a BA, which involves relativelyeasy construction.Since LTL is strictly less expressive than BA, the reverse construction is not possible.The algorithms for transforming LTL to GBAdiffer in their construction strategies but they all have common underlying principle, i.e., each state in the constructed automaton represents a set of LTL formulasthat are expected to be satisfied by the remaining input word after occurrence of the state during a run.".
- Q6553530 wikiPageExternalLink ltl3ba.
- Q6553530 wikiPageExternalLink spot.lip6.fr.
- Q6553530 wikiPageExternalLink ltl2ba.
- Q6553530 wikiPageWikiLink Q1020380.
- Q6553530 wikiPageWikiLink Q1536492.
- Q6553530 wikiPageWikiLink Q1569697.
- Q6553530 wikiPageWikiLink Q1585964.
- Q6553530 wikiPageWikiLink Q173326.
- Q6553530 wikiPageWikiLink Q4334568.
- Q6553530 wikiPageWikiLink Q5532429.
- Q6553530 wikiPageWikiLink Q7036095.
- Q6553530 wikiPageWikiLink Q8637035.
- Q6553530 wikiPageWikiLink Q8842299.
- Q6553530 comment "In formal verification,finite state model checking needs to compute an equivalent Büchi automaton (BA) to a Linear temporal logic (LTL) formula,i.e., the LTL formula and the BA recognizes the same ω-language.There are algorithms that translate an LTL formula to an equivalent BA.".
- Q6553530 label "Linear temporal logic to Büchi automaton".