We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of the classical omega-regular objectives, and show how to solve those problems optimally.
The Complexity of Rational Synthesis
GENTILINI, Raffaella;
2016
Abstract
We study the computational complexity of the cooperative and non-cooperative rational synthesis problems, as introduced by Kupferman, Vardi and co-authors. We provide tight results for most of the classical omega-regular objectives, and show how to solve those problems optimally.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
LIPIcs-ICALP-2016-121.pdf
accesso aperto
Tipologia di allegato:
PDF-editoriale
Licenza:
Creative commons
Dimensione
618.27 kB
Formato
Adobe PDF
|
618.27 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
