Monte Carlo Tree Search for Priced Timed Automata

Autor: Jensen, Peter Gjøl, Kiviriga, Andrej, Guldstrand Larsen, Kim, Nyman, Ulrik, Mijačika, Adriana, Høiriis Mortensen, Jeppe

Publikováno v: Jensen, P G, Kiviriga, A, Guldstrand Larsen, K, Nyman, U, Mijačika, A & Høiriis Mortensen, J 2022, Monte Carlo Tree Search for Priced Timed Automata . in E Ábrahám & M Paolieri (eds), Quantitative Evaluation of Systems : 19th International Conference, QEST 2022, Proceedings . Springer, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 13479 LNCS, pp. 381-398, 19th International Conference on Quantitative Evaluation of Systems, QEST 2022, Warsaw, Poland, 12/09/2022 . https://doi.org/10.1007/978-3-031-16336-4_19

Priced timed automata (PTA) were introduced in the early 2000s to allow for generic modelling of resource-consumption problems for systems with real-time constraints. Optimal schedules for allocation of resources may here be recast as optimal reachab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::09587a5c3e3aeb0ecb89ea535f808032
https://vbn.aau.dk/ws/files/493737469/2022_QEST_Nyman.pdf