Linear temporal logic to Büchi automaton: Difference between revisions

Content deleted Content added
Gerth et al. algorithm: During Step 2. LGBA construction, the label of each state are atomic propositions, thus in the statement a ⊆ {p ∈ ''P'' | ¬p ∉ ''Now''(q) } } , p should be also an atomic proposition.
Cydebot (talk | contribs)
Line 251:
 
{{DEFAULTSORT:Linear temporal logic to Buchi automaton}}
[[Category:Automata theory(computation)]]
[[Category:Model checking]]
[[Category:Temporal logic]]