{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,5]],"date-time":"2025-06-05T04:53:22Z","timestamp":1749099202265,"version":"3.40.3"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031163357"},{"type":"electronic","value":"9783031163364"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16336-4_19","type":"book-chapter","created":{"date-parts":[[2022,9,10]],"date-time":"2022-09-10T18:02:40Z","timestamp":1662832960000},"page":"381-398","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Monte Carlo Tree Search for\u00a0Priced Timed Automata"],"prefix":"10.1007","author":[{"given":"Peter Gj\u00f8l","family":"Jensen","sequence":"first","affiliation":[]},{"given":"Andrej","family":"Kiviriga","sequence":"additional","affiliation":[]},{"given":"Kim","family":"Guldstrand Larsen","sequence":"additional","affiliation":[]},{"given":"Ulrik","family":"Nyman","sequence":"additional","affiliation":[]},{"given":"Adriana","family":"Mija\u010dika","sequence":"additional","affiliation":[]},{"given":"Jeppe","family":"H\u00f8iriis Mortensen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,9,11]]},"reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/3-540-44585-4_46","volume-title":"Computer Aided Verification","author":"Y Abdedda\u00efm","year":"2001","unstructured":"Abdedda\u00efm, Y., Maler, O.: Job-shop scheduling using timed automata? In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 478\u2013492. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44585-4_46"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Ahmad, W., H\u00f6lzenspies, P.K.F., Stoelinga, M., van de Pol, J.: Green computing: power optimisation of VFI-based real-time multiprocessor dataflow applications. In: DSD 2015, pp. 271\u2013275. IEEE Computer Society (2015). https:\/\/doi.org\/10.1109\/DSD.2015.59","DOI":"10.1109\/DSD.2015.59"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BFb0031987","volume-title":"Real-Time: Theory in Practice","author":"R Alur","year":"1992","unstructured":"Alur, R., Dill, D.: The theory of timed automata. In: de Bakker, J.W., Huizing, C., de Roever, W.P., Rozenberg, G. (eds.) REX 1991. LNCS, vol. 600, pp. 45\u201373. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/BFb0031987"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/3-540-45351-2_8","volume-title":"Hybrid Systems: Computation and Control","author":"R Alur","year":"2001","unstructured":"Alur, R., La Torre, S., Pappas, G.J.: Optimal paths in weighted timed automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 49\u201362. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_8"},{"issue":"3","key":"19_CR5","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/j.engappai.2011.08.003","volume":"25","author":"A Banharnsakun","year":"2012","unstructured":"Banharnsakun, A., Sirinaovakul, B., Achalakul, T.: Job shop scheduling with the best-so-far ABC. Eng. Appl. Artif. Intell. 25(3), 583\u2013593 (2012). https:\/\/doi.org\/10.1016\/j.engappai.2011.08.003","journal-title":"Eng. Appl. Artif. Intell."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-45319-9_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., Fehnker, A., Hune, T., Larsen, K., Pettersson, P., Romijn, J.: Efficient guiding towards cost-optimality in UPPAAL. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 174\u2013188. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45319-9_13"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45351-2_15","volume-title":"Hybrid Systems: Computation and Control","author":"G Behrmann","year":"2001","unstructured":"Behrmann, G., et al.: Minimum-cost reachability for priced time automata. In: Di Benedetto, M.D., Sangiovanni-Vincentelli, A. (eds.) HSCC 2001. LNCS, vol. 2034, pp. 147\u2013161. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45351-2_15"},{"issue":"4","key":"19_CR8","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/1059816.1059823","volume":"32","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Optimal scheduling using priced timed automata. SIGMETRICS Perform. Eval. Rev. 32(4), 34\u201340 (2005). https:\/\/doi.org\/10.1145\/1059816.1059823","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/11561163_8","volume-title":"Formal Methods for Components and Objects","author":"G Behrmann","year":"2005","unstructured":"Behrmann, G., Larsen, K.G., Rasmussen, J.I.: Priced timed automata: algorithms and applications. In: de Boer, F.S., Bonsangue, M.M., Graf, S., de Roever, W.-P. (eds.) FMCO 2004. LNCS, vol. 3657, pp. 162\u2013182. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561163_8"},{"issue":"2","key":"19_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s00165-018-0458-2","volume":"31","author":"M Bisgaard","year":"2019","unstructured":"Bisgaard, M., Gerhardt, D., Hermanns, H., Kr\u010d\u00e1l, J., Nies, G., Stenger, M.: Battery-aware scheduling in low orbit: the GomX-3 case. Formal Aspects Comput. 31(2), 261\u2013285 (2019). https:\/\/doi.org\/10.1007\/s00165-018-0458-2","journal-title":"Formal Aspects Comput."},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-030-22348-9_3","volume-title":"Models, Mindsets, Meta: The What, the How, and the Why Not?","author":"T B\u00f8gholm","year":"2019","unstructured":"B\u00f8gholm, T., Larsen, K.G., Mu\u00f1iz, M., Thomsen, B., Thomsen, L.L.: Analyzing spreadsheets for parallel execution via model checking. In: Margaria, T., Graf, S., Larsen, K.G. (eds.) Models, Mindsets, Meta: The What, the How, and the Why Not? LNCS, vol. 11200, pp. 27\u201335. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-22348-9_3"},{"issue":"2","key":"19_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s10703-007-0035-4","volume":"31","author":"P Bouyer","year":"2007","unstructured":"Bouyer, P., Brihaye, T., Bruy\u00e8re, V., Raskin, J.: On the optimal reachability problem of weighted timed automata. Formal Methods Syst. Des. 31(2), 135\u2013175 (2007). https:\/\/doi.org\/10.1007\/s10703-007-0035-4","journal-title":"Formal Methods Syst. Des."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-319-41528-4_28","volume-title":"Computer Aided Verification","author":"P Bouyer","year":"2016","unstructured":"Bouyer, P., Colange, M., Markey, N.: Symbolic optimal reachability in weighted timed automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 513\u2013530. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41528-4_28"},{"issue":"9","key":"19_CR14","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1145\/1995376.1995396","volume":"54","author":"P Bouyer","year":"2011","unstructured":"Bouyer, P., Fahrenberg, U., Larsen, K.G., Markey, N.: Quantitative analysis of real-time systems using priced timed automata. Commun. ACM 54(9), 78\u201387 (2011). https:\/\/doi.org\/10.1145\/1995376.1995396","journal-title":"Commun. ACM"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/3-540-48153-2_11","volume-title":"Correct Hardware Design and Verification Methods","author":"M Bozga","year":"1999","unstructured":"Bozga, M., Maler, O., Tripakis, S.: Efficient verification of timed automata using dense and discrete time semantics. In: Pierre, L., Kropf, T. (eds.) CHARME 1999. LNCS, vol. 1703, pp. 125\u2013141. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48153-2_11"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"CB Browne","year":"2012","unstructured":"Browne, C.B., et al.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012). https:\/\/doi.org\/10.1109\/TCIAIG.2012.2186810","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-642-34032-1_29","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Applications and Case Studies","author":"A \u010cau\u0161evi\u0107","year":"2012","unstructured":"\u010cau\u0161evi\u0107, A., Seceleanu, C., Pettersson, P.: Checking correctness of services modeled as priced timed automata. In: Margaria, T., Steffen, B. (eds.) ISoLA 2012. LNCS, vol. 7610, pp. 308\u2013322. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34032-1_29"},{"key":"19_CR18","unstructured":"Dirks, H.: Finding optimal plans for domains with restricted continuous effects with UPPAAL CORA. In: ICAPS 2005. American Association for Artificial Intelligence (2005)"},{"key":"19_CR19","unstructured":"Edelkamp, S.: Heuristic search planning with BDDs. In: PuK 2000 (2000). http:\/\/www.puk-workshop.de\/puk2000\/papers\/edelkamp.pdf"},{"key":"19_CR20","unstructured":"Ejsing, A., Jensen, M., Mu\u00f1iz, M., N\u00f8rhave, J., Rechter, L.: Near optimal task graph scheduling with priced timed automata and priced timed Markov decision processes (2020)"},{"key":"19_CR21","unstructured":"Geuze, N.: Energy management in smart grids using timed automata. Master\u2019s thesis, University of Twente (2019)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: what\u2019s the difference anyway? In: Nineteenth International Conference on Automated Planning and Scheduling (2009)","DOI":"10.1609\/icaps.v19i1.13370"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Hermanns, H., Krc\u00e1l, J., Nies, G.: How is your satellite doing? Battery kinetics with recharging and uncertainty. Leibniz Trans. Embed. Syst. 4(1), 04:1\u201304:28 (2017). https:\/\/doi.org\/10.4230\/LITES-v004-i001-a004","DOI":"10.4230\/LITES-v004-i001-a004"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: fast plan generation through heuristic search. J. Artif. Intell. Res. 14, 253\u2013302 (2001)","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Huang, J., Liu, Z., Lu, B., Xiao, F.: Pruning in UCT algorithm. In: 2010 International Conference on Technologies and Applications of Artificial Intelligence, pp. 177\u2013181 (2010). https:\/\/doi.org\/10.1109\/TAAI.2010.38","DOI":"10.1109\/TAAI.2010.38"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/S0377-2217(98)00113-1","volume":"113","author":"A Jain","year":"1999","unstructured":"Jain, A., Meeran, S.: Deterministic job-shop scheduling: past, present and future. Eur. J. Oper. Res. 113(2), 390\u2013434 (1999). https:\/\/doi.org\/10.1016\/S0377-2217(98)00113-1","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR27","doi-asserted-by":"publisher","unstructured":"Jongerden, M.R., Haverkort, B.R., Bohnenkamp, H.C., Katoen, J.: Maximizing system lifetime by battery scheduling. In: IEEE\/IFIP International Conference on DSN 2009, pp. 63\u201372. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/DSN.2009.5270351","DOI":"10.1109\/DSN.2009.5270351"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-85248-1_9","volume-title":"Formal Methods for Industrial Critical Systems","author":"A Kiviriga","year":"2021","unstructured":"Kiviriga, A., Larsen, K.G., Nyman, U.: Randomized reachability analysis in UPPAAL: fast error detection in timed systems. In: Lluch Lafuente, A., Mavridou, A. (eds.) FMICS 2021. LNCS, vol. 12863, pp. 149\u2013166. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85248-1_9"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"19_CR30","unstructured":"Korvell, A., Degn, K.: Designing a tool-chain for generating battery-aware contact plans using UPPAAL. Master thesis, Aalborg University (2019)"},{"key":"19_CR31","unstructured":"K\u00f8rvell, A., Degn, K.: Designing a tool-chain for generating battery-aware contact plans using UPPAAL (2019)"},{"key":"19_CR32","unstructured":"Kasahara Laboratory: Standard task graph set. https:\/\/www.kasahara.cs.waseda.ac.jp\/schedule\/index.html"},{"issue":"4","key":"19_CR33","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/s10626-020-00313-1","volume":"30","author":"R Saddem-yagoubi","year":"2020","unstructured":"Saddem-yagoubi, R., Naud, O., Godary-dejean, K., Crestani, D.: Model-checking precision agriculture logistics: the case of the differential harvest. Discrete Event Dyn. Syst. 30(4), 579\u2013604 (2020). https:\/\/doi.org\/10.1007\/s10626-020-00313-1","journal-title":"Discrete Event Dyn. Syst."},{"issue":"5","key":"19_CR34","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1002\/jos.116","volume":"5","author":"T Tobita","year":"2002","unstructured":"Tobita, T., Kasahara, H.: A standard task graph set for fair evaluation of multiprocessor scheduling algorithms. J. Sched. 5(5), 379\u2013394 (2002). https:\/\/doi.org\/10.1002\/jos.116","journal-title":"J. Sched."},{"key":"19_CR35","doi-asserted-by":"crossref","unstructured":"Vulgarakis, A., \u010cau\u0161evi\u0107, A.: Applying REMES behavioral modeling to PLC systems. In: 2009 XXII International Symposium on Information, Communication and Automation Technologies, pp. 1\u20138. IEEE (2009)","DOI":"10.1109\/ICAT.2009.5348453"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16336-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T17:52:33Z","timestamp":1676742753000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16336-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031163357","9783031163364"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16336-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"11 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Warsaw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest.org\/qest2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}