Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Aaron Bohy"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 157, Iss Proc. SYNT 2014, Pp 51-67 (2014)
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in
Externí odkaz:
https://doaj.org/article/7532704daa904753bd09a4b80fc8c6ab
Publikováno v:
Acta Informatica
Acta Informatica, Springer Verlag, 2017, 54 (6), pp.545-587. ⟨10.1007/s00236-016-0255-4⟩
Acta Informatica, 2017, 54 (6), pp.545-587. ⟨10.1007/s00236-016-0255-4⟩
Acta Informatica, Springer Verlag, 2017, 54 (6), pp.545-587. ⟨10.1007/s00236-016-0255-4⟩
Acta Informatica, 2017, 54 (6), pp.545-587. ⟨10.1007/s00236-016-0255-4⟩
When treating Markov decision processes (MDPs) with large state spaces, using explicit representations quickly becomes unfeasible. Lately, Wimmer et al. have proposed a so-called symblicit algorithm for the synthesis of optimal strategies in MDPs, in
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7644be64beb3bafc979fcc2109212e6a
https://hal.inria.fr/hal-01635132
https://hal.inria.fr/hal-01635132
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783642367410
TACAS
Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2013, Unknown, Unknown Region. pp.169-184, ⟨10.1007/978-3-642-36742-7_12⟩
Lecture Notes in Computer Science
TACAS
Tools and Algorithms for the Construction and Analysis of Systems (TACAS)
Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2013, Unknown, Unknown Region. pp.169-184, ⟨10.1007/978-3-642-36742-7_12⟩
Lecture Notes in Computer Science
The classical LTL synthesis problem is purely qualitative: the given LTL specification is realized or not by a reactive system. LTL is not expressive enough to formalize the correctness of reactive systems with respect to some quantitative aspects. T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b63b823ece76f69b0e36e6bd7b9345df
https://doi.org/10.1007/978-3-642-36742-7_12
https://doi.org/10.1007/978-3-642-36742-7_12
Publikováno v:
Computer Aided Verification (CAV)
Computer Aided Verification (CAV), 2012, Unknown, Unknown Region. pp.652-657, ⟨10.1007/978-3-642-31424-7_45⟩
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783642314230
CAV
Computer Aided Verification (CAV), 2012, Unknown, Unknown Region. pp.652-657, ⟨10.1007/978-3-642-31424-7_45⟩
Lecture Notes in Computer Science
Computer Aided Verification ISBN: 9783642314230
CAV
We present Acacia+, a tool for solving the LTL realizability and synthesis problems. We use recent approaches that reduce these problems to safety games, and can be solved efficiently by symbolic incremental algorithms based on antichains. The reduct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::169c52cd0d18c7b54b3134bd6edef2eb
https://hal.archives-ouvertes.fr/hal-01196263
https://hal.archives-ouvertes.fr/hal-01196263