Linear temporal logic to Büchi automaton
id:
linear-temporal-logic-to-b-chi-automaton-310-18205431
title:
Linear temporal logic to Büchi automaton
text:
In formal verification,
finite state model checking needs to find a Büchi automaton (BA) equivalent to a given linear temporal logic (LTL) formula, i.e., such that the LTL formula and the BA recognize the same ω-language. There are algorithms that translate an LTL formula to a 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 a relatively easy constru
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Linear_temporal_logic_to_B%C3%BCchi_automaton
date created:
date modified:
2024-02-11T23:53:28Z
main entity:
{"identifier":"Q6553530","url":"https://www.wikidata.org/entity/Q6553530"}
image:
fields total:
13
integrity:
13