{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:35:42Z","timestamp":1740141342261,"version":"3.37.3"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"name":"NSERC Discovery","award":["418396-2012"],"award-info":[{"award-number":["418396-2012"]}]},{"name":"NSERC Strategic","award":["430575-2012"],"award-info":[{"award-number":["430575-2012"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Dependable and Secure Comput."],"published-print":{"date-parts":[[2018,5,1]]},"DOI":"10.1109\/tdsc.2016.2596719","type":"journal-article","created":{"date-parts":[[2016,7,29]],"date-time":"2016-07-29T18:24:27Z","timestamp":1469816667000},"page":"526-541","source":"Crossref","is-referenced-by-count":1,"title":["Symbolic Synthesis of Timed Models with Strict 2-Phase Fault Recovery"],"prefix":"10.1109","volume":"15","author":[{"given":"Fathiyeh","family":"Faghih","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1800-5419","authenticated-orcid":false,"given":"Borzoo","family":"Bonakdarpour","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10703-009-0084-y"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-014-0325-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52148-8_17"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48119-2_19"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-49213-5_5"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90005-G"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90056-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27755-2_3"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_14"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45089-0_3"},{"key":"ref3","first-page":"243","article-title":"Quantitative synthesis for concurrent programs","author":"cern","year":"0","journal-title":"Proc 23rd Int Conf Comput Aided Verification"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_12"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/5.21072"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1168918.1168907"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0139-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59042-0_76"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/277697.277729"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-49823-0_9"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(83)90017-5"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11539452_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-10(1:12)2014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.21236\/ADA486602"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)42032-5"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45739-9_14"},{"key":"ref26","first-page":"53","article-title":"Simple linear-time algorithms for minimal fixed points (extended abstract)","author":"liu","year":"0","journal-title":"Proceedings of the 20th International Colloquium on Automata Languages and Programming"},{"key":"ref25","first-page":"66","article-title":"Efficient on-the-fly algorithms for the analysis of timed games","author":"cassez","year":"0","journal-title":"Proc 16th Int'l Conf Concurrency Theory"}],"container-title":["IEEE Transactions on Dependable and Secure Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8858\/8356073\/07526327.pdf?arnumber=7526327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:25:55Z","timestamp":1642004755000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7526327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,1]]},"references-count":28,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tdsc.2016.2596719","relation":{},"ISSN":["1545-5971"],"issn-type":[{"type":"print","value":"1545-5971"}],"subject":[],"published":{"date-parts":[[2018,5,1]]}}}