{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:16:12Z","timestamp":1725596172873},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/rivf.2019.8713701","type":"proceedings-article","created":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T21:27:30Z","timestamp":1558042050000},"page":"1-4","source":"Crossref","is-referenced-by-count":1,"title":["The Logic of Temporal Domination"],"prefix":"10.1109","author":[{"given":"Thomas","family":"Studer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"37","article-title":"k-counting automata","author":"ultes-nitsche","year":"2011","journal-title":"Non-Classical Models for Automata and Applications - NCMA 2011"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2012021"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(66)80003-7"},{"key":"ref6","first-page":"1","article-title":"On a decision method in restricted second order arithmetic","author":"b\u00fcchi","year":"1962","journal-title":"6th International Congress for Logic Methodology and Philosophy of Science"},{"journal-title":"Introduction to Automata Theory Languages and Computation","year":"2006","author":"hopcroft","key":"ref11"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90443-0"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1145\/3209108.3209138","article-title":"A Simple and Optimal Complementation Algorithm for Büchi Automata","author":"allred","year":"2018","journal-title":"33rd Annual ACM\/IEEE Symposium on Logic in Computer Science"},{"key":"ref7","first-page":"3","article-title":"Infinite sequences and infinite machines","author":"muller","year":"1963","journal-title":"AIEE Proc of the 4th Annual Symposium on Switching Theory and Logical Design"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-444-88074-1.50021-4"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.2307\/1970290"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"}],"event":{"name":"2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)","start":{"date-parts":[[2019,3,20]]},"location":"Danang, Vietnam","end":{"date-parts":[[2019,3,22]]}},"container-title":["2019 IEEE-RIVF International Conference on Computing and Communication Technologies (RIVF)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8705149\/8713612\/08713701.pdf?arnumber=8713701","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T20:19:21Z","timestamp":1658261961000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8713701\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/rivf.2019.8713701","relation":{},"subject":[],"published":{"date-parts":[[2019,3]]}}}