Best-Effort Synthesis: Doing Your Best Is Not Harder Than Giving Up
We study best-effort synthesis under environment assumptions specified in LTL, and show that this problem has exactly the same computational complexity of standard LTL synthesis: 2EXPTIME-complete. We provide optimal algorithms for computing best-effort strategies, both in the case of LTL over infinite traces and LTL over finite traces (i.e., LTLf). The latter are particularly well suited for implementation.
2009 ◽
Vol E92-A
(11)
◽
pp. 2717-2722
◽
2016 ◽
Vol E99.A
(12)
◽
pp. 2211-2217
2019 ◽
Vol 8
(5)
◽
pp. 2370-2377
2015 ◽
Vol 1
◽
pp. 41
Keyword(s):
2009 ◽
Vol 20
(9)
◽
pp. 2344-2351
◽
Keyword(s):