{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,30]],"date-time":"2026-08-30T01:05:34Z","timestamp":1788051934376,"version":"build-2784847793"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1109\/wsc.2017.8247885","type":"proceedings-article","created":{"date-parts":[[2018,1,8]],"date-time":"2018-01-08T17:43:13Z","timestamp":1515433393000},"page":"1419-1430","source":"Crossref","is-referenced-by-count":12,"title":["Efficient simulation-based verification of probabilistic timed automata"],"prefix":"10.1109","author":[{"given":"Arnd","family":"Hartmanns","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sean","family":"Sedwards","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pedro R.","family":"D'Argenio","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-54862-8_51"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2968478.2968496"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/QEST.2012.19"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24622-0_8"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1023\/A:1017984413808"},{"key":"ref15","first-page":"203","article-title":"The PRISM Benchmark Suite","author":"kwiatkowska","year":"2012","journal-title":"QEST"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00046-9"},{"key":"ref17","first-page":"350","article-title":"Scalable Verification of Markov Decision Processes","author":"legay","year":"2014","journal-title":"WS-FMDS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-012-0177-x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23267-6_14"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11936-6_8"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.104"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-015-0383-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-33693-0_7"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_27"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_16"},{"key":"ref2","first-page":"87","article-title":"Timed Automata: Semantics, Algorithms and Tools","author":"bengtsson","year":"2003","journal-title":"Lectures on Concurrency and Petri Nets Advances in Petri Nets"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"ref9","article-title":"Reachability and Reward Checking for Stochastic Timed Automata","author":"hahn","year":"2014","journal-title":"Electronic Communications of the EASST 70"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_17"}],"event":{"name":"2017 Winter Simulation Conference (WSC)","location":"Las Vegas, NV","start":{"date-parts":[[2017,12,3]]},"end":{"date-parts":[[2017,12,6]]}},"container-title":["2017 Winter Simulation Conference (WSC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8232982\/8247314\/08247885.pdf?arnumber=8247885","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,12]],"date-time":"2018-02-12T17:54:26Z","timestamp":1518458066000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8247885\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/wsc.2017.8247885","relation":{},"subject":[],"published":{"date-parts":[[2017,12]]}}}