{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,3]],"date-time":"2026-10-03T13:07:19Z","timestamp":1791032839030,"version":"4.1.0"},"reference-count":16,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":["ieeexplore.ieee.orgieee.org"],"crossmark-restriction":true},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/tac.2011.2173774","type":"journal-article","created":{"date-parts":[[2011,10,28]],"date-time":"2011-10-28T14:59:14Z","timestamp":1319813954000},"page":"1265-1269","update-policy":"https:\/\/doi.org\/10.1109\/crossmark_policy","source":"Crossref","is-referenced-by-count":140,"title":["Verification of Infinite-Step Opacity and Complexity Considerations"],"prefix":"10.1109","volume":"57","author":[{"given":"Anooshiravan","family":"Saboori","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoforos N.","family":"Hadjicostis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0020-5"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605918"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.847749"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.conengprac.2010.12.003"},{"key":"ref15","author":"saboori","year":"0","journal-title":"Supplementary material for the paper \"Verification of infinite-step opacity and complexity considerations"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04761-9_26"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2106775"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71209-1_51"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/WODES.2008.4605967"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/imamci\/8.1.45"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2004.10.010"},{"key":"ref7","author":"garey","year":"1979","journal-title":"Computers and Intractability-A Guide to the Theory of NP-Completeness"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-008-0058-x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-24098-5_12"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CSFW.1994.315941"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9\/6187742\/06062385.pdf?arnumber=6062385","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:53:10Z","timestamp":1633909990000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6062385\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":16,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tac.2011.2173774","relation":{},"ISSN":["0018-9286","1558-2523"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}