{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:21:30Z","timestamp":1762521690957},"reference-count":11,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NTU Start-up","award":["COE_SUG\/RSS_20AUG10_4\/14"],"award-info":[{"award-number":["COE_SUG\/RSS_20AUG10_4\/14"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/tac.2014.2342099","type":"journal-article","created":{"date-parts":[[2014,7,23]],"date-time":"2014-07-23T20:09:57Z","timestamp":1406146197000},"page":"534-539","source":"Crossref","is-referenced-by-count":5,"title":["A Polynomial-Time Algorithm for Computing Finite-Makespan Controllable Sublanguages"],"prefix":"10.1109","volume":"60","author":[{"given":"Rong","family":"Su","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","article-title":"Approximation algorithm for NP-hard optimization problems","author":"klein","year":"1999","journal-title":"Algorithms and Theory of Computation Handbook (Charpter 34)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/9.272327"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2011.06.024"},{"key":"ref6","author":"pinedo","year":"2008","journal-title":"Scheduling Theory Algorithms and Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5102-9_54-1"},{"key":"ref5","article-title":"Temporal logic for real-time systems","author":"ostroff","year":"1989","journal-title":"Advanced Software Development Series"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/0325013"},{"key":"ref2","first-page":"19","article-title":"As soon as possible: Time optimal control for timed automata","author":"asarin","year":"0","journal-title":"Proc 2nd Int Workshop Hybrid Syst Comput Control (HSCC99) vol 1569 of LNCS"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1109\/TAC.2011.2157391","article-title":"The synthesis of time optimal supervisors by using heaps-of-pieces","volume":"57","author":"su","year":"2012","journal-title":"IEEE Trans Autom Control"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/7017603\/06862857.pdf?arnumber=6862857","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:04:19Z","timestamp":1642003459000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/6862857"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":11,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tac.2014.2342099","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}