{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T15:03:48Z","timestamp":1730300628702,"version":"3.28.0"},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/time.2016.12","type":"proceedings-article","created":{"date-parts":[[2016,12,8]],"date-time":"2016-12-08T21:33:55Z","timestamp":1481232835000},"page":"41-50","source":"Crossref","is-referenced-by-count":1,"title":["Verify LTL with Fairness Assumptions Efficiently"],"prefix":"10.1109","author":[{"given":"Yong","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Feng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","first-page":"332","article-title":"An automata-theoretic approach to automatic program verification (preliminary report)","author":"vardi","year":"1986","journal-title":"LICS"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/10722167_21"},{"key":"ref10","first-page":"267","article-title":"Efficient model checking in fragments of the propositional mu-calculus (extended abstract)","author":"emerson","year":"1986","journal-title":"LICS"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_13"},{"key":"ref12","first-page":"153","article-title":"Optimizing Büchi automata","volume":"1877","author":"etessami","year":"2000","journal-title":"CONCUR"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4886-6"},{"key":"ref14","first-page":"53","article-title":"Fast LTL to Büchi automata translation","volume":"2102","author":"gastin","year":"2001","journal-title":"CAV"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31980-1_13"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/32.588521"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_57"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011254632723"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2014.6942756"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48683-6_21"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211865"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2010.5509503"},{"key":"ref27","article-title":"Limit-Deterministic Büchi Automata for Linear Temporal Logic","author":"sickert","year":"2016","journal-title":"CAV LNCS"},{"key":"ref6","first-page":"318","article-title":"Relating hierarchy of temporal properties to model checking","volume":"2747","author":"cern\u00e1","year":"2003","journal-title":"MFCS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90017-A"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"ref8","first-page":"249","article-title":"Improved automata generation for linear temporal logic","volume":"1633","author":"daniele","year":"1999","journal-title":"CAV"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s100090050046"},{"journal-title":"Principles of Model Checking","year":"2008","author":"baier","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01782772"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOT.2004.1348184"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.229904"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73370-6_17"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2016.12"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/BF00265555"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.32"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73370-6_11"},{"key":"ref25","first-page":"580","article-title":"Strength-based decomposition of the property Büchi automaton for faster model checking","volume":"7795","author":"renault","year":"2013","journal-title":"TACAS"}],"event":{"name":"2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)","start":{"date-parts":[[2016,10,17]]},"location":"Kongens Lyngby, Denmark","end":{"date-parts":[[2016,10,19]]}},"container-title":["2016 23rd International Symposium on Temporal Representation and Reasoning (TIME)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7774233\/7774630\/07774646.pdf?arnumber=7774646","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T20:00:06Z","timestamp":1513195206000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7774646\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/time.2016.12","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}