From LTL to unambiguous Büchi automata via disambiguation of alternating automata (Q2147688)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From LTL to unambiguous Büchi automata via disambiguation of alternating automata |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From LTL to unambiguous Büchi automata via disambiguation of alternating automata |
scientific article |
Statements
From LTL to unambiguous Büchi automata via disambiguation of alternating automata (English)
0 references
20 June 2022
0 references
\(\omega\)-automata
0 references
unambiguous Büchi automata
0 references
linear temporal logic
0 references
verification
0 references
alternating automata
0 references
0 references
0.8174786567687988
0 references
0.8076013326644897
0 references
0.8048834800720215
0 references
0.7873237729072571
0 references
