{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:11:24Z","timestamp":1750306284046,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,4,4]],"date-time":"2016-04-04T00:00:00Z","timestamp":1459728000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,4,4]]},"DOI":"10.1145\/2851613.2851828","type":"proceedings-article","created":{"date-parts":[[2016,6,2]],"date-time":"2016-06-02T19:23:42Z","timestamp":1464895422000},"page":"1634-1640","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Time optimal reachability analysis using swarm verification"],"prefix":"10.1145","author":[{"given":"Zhengkui","family":"Zhang","sequence":"first","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Nielsen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kim G.","family":"Larsen","sequence":"additional","affiliation":[{"name":"Aalborg University, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,4,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.11.018"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/PDMC-HiBi.2010.9"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2932439.2932561"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30080-9_7"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/646485.694458"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/646881.710599"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/647769.733955"},{"key":"e_1_3_2_1_9_1","series-title":"LNCS","first-page":"87","volume-title":"Lectures on Concurrency and Petri Nets","author":"Bengtsson J.","year":"2003","unstructured":"J. Bengtsson and W. Yi. Timed automata: Semantics, algorithms and tools. In Lectures on Concurrency and Petri Nets, volume 3098 of LNCS, pages 87--124. Springer, 2003."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_31"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/647767.733781"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/519167.828753"},{"key":"e_1_3_2_1_13_1","volume-title":"Bounding and Heuristics in Forward Reachability Algorithms. UB Nijmegen {Host}","author":"Fehnker A.","year":"2000","unstructured":"A. Fehnker. Bounding and Heuristics in Forward Reachability Algorithms. UB Nijmegen {Host}, 2000."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2008.9"},{"key":"e_1_3_2_1_15_1","first-page":"E15","volume-title":"ICDCS Workshop","author":"Hune T.","year":"2000","unstructured":"T. Hune, K. G. Larsen, and P. Pettersson. Guided synthesis of control programs using uppaal. In ICDCS Workshop, pages E15--E22, 2000."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/647897.740765"},{"key":"e_1_3_2_1_17_1","volume-title":"IEEE Mediteranean Control Conference","author":"Niebert P.","year":"2000","unstructured":"P. Niebert, S. Tripakis, and S. Yovine. Minimum-time reachability for timed automata. In IEEE Mediteranean Control Conference, 2000."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1763507.1763532"}],"event":{"name":"SAC 2016: Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Pisa Italy","acronym":"SAC 2016"},"container-title":["Proceedings of the 31st Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851828","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2851613.2851828","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:38:57Z","timestamp":1750221537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2851613.2851828"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,4]]},"references-count":18,"alternative-id":["10.1145\/2851613.2851828","10.1145\/2851613"],"URL":"https:\/\/doi.org\/10.1145\/2851613.2851828","relation":{},"subject":[],"published":{"date-parts":[[2016,4,4]]},"assertion":[{"value":"2016-04-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}