The complexity of admissibility in omega-regular games (Q4635606)
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: The complexity of admissibility in omega-regular games |
scientific article; zbMATH DE number 6863081
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of admissibility in omega-regular games |
scientific article; zbMATH DE number 6863081 |
Statements
The complexity of admissibility in Omega-regular games (English)
0 references
23 April 2018
0 references
LTL
0 references
Muller games
0 references
admissible strategies
0 references
safety
0 references
synthesis
0 references
0.851170539855957
0 references
0.7977331876754761
0 references
0.7937369346618652
0 references
0.7641637921333313
0 references
