{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T21:51:41Z","timestamp":1729633901062,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1109\/acc.2009.5160198","type":"proceedings-article","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T15:56:27Z","timestamp":1248105387000},"page":"5653-5658","source":"Crossref","is-referenced-by-count":2,"title":["On identification of input\/output extended automata with finite bisimilar quotients"],"prefix":"10.1109","author":[{"given":"Changyan","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ratnesh","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2003.1272635"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01384313"},{"year":"0","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2006.1657692"},{"key":"16","first-page":"50","article-title":"symbolic transition graph with assignment","author":"lin","year":"1996","journal-title":"Concurrency"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1042038.1042039"},{"year":"0","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6423(01)00008-9"},{"key":"12","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1109\/LICS.1996.561342","article-title":"the theory of hybrid automata","author":"henzinger","year":"1996","journal-title":"Proceedings 11th Annual IEEE Symposium on Logic in Computer Science LICS-96"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/32.489079"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2004.838497"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/5.871304"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00172-F"},{"key":"7","first-page":"400","article-title":"symbolic model checking of infinite state systems using presburger arithmetic","author":"bultan","year":"1997","journal-title":"CAV"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.04.003"},{"key":"5","first-page":"113","article-title":"bebop: a symbolic model checker for boolean programs","volume":"1885","author":"ball","year":"2000","journal-title":"LNCS"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/378795.378846"},{"key":"9","article-title":"construction of abstract state graphs with pvs","volume":"1254","author":"graf","year":"1997","journal-title":"LNCS"},{"key":"8","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/157485.164585","article-title":"automatic functional test generation using the extended finite state machine model","author":"cheng","year":"1993","journal-title":"30th ACM\/IEEE Design Automation Conference"}],"event":{"name":"2009 American Control Conference","start":{"date-parts":[[2009,6,10]]},"location":"St. Louis, MO, USA","end":{"date-parts":[[2009,6,12]]}},"container-title":["2009 American Control Conference"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5089257\/5159764\/05160198.pdf?arnumber=5160198","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T18:06:54Z","timestamp":1497809214000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5160198\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/acc.2009.5160198","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}