{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:36:03Z","timestamp":1729629363148,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1109\/rivf.2012.6169852","type":"proceedings-article","created":{"date-parts":[[2012,3,26]],"date-time":"2012-03-26T17:51:16Z","timestamp":1332784276000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games"],"prefix":"10.1109","author":[{"given":"Manh Ha","family":"Le","sequence":"first","affiliation":[]},{"given":"Van Trung","family":"Pham","sequence":"additional","affiliation":[]},{"given":"Thi Ha Duong","family":"Phan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90046-Y"},{"journal-title":"The reachability problem requires exponential space","year":"1976","author":"lipton","key":"17"},{"key":"23","first-page":"293","article-title":"Reachability problem of state machines with batch processing arcs","author":"mizumo","year":"2008","journal-title":"Proc The 23rd International Technical Conference on Circuits\/Systems Computers and Communication (ITC-CSCC 2008)"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/0213029"},{"key":"15","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"kosaraju","year":"1982","journal-title":"Proc 74th Annual ACM Symp Theory Computing San Francisco"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-2789(01)00236-6"},{"journal-title":"On the Reachability Problem for Some Classes of Petri Nets","year":"1992","author":"stewart","key":"13"},{"key":"14","first-page":"102","article-title":"A fundamental theorem of asynchronous parallel computation","volume":"24","author":"keller","year":"1975","journal-title":"LNCS"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90013-X"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(83)80022-9"},{"key":"21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0304-3975(86)90026-5","article-title":"Some complexity bounds for problems concerning finite and 2-dimensional vector addition systems with states","volume":"46","author":"huynh","year":"1986","journal-title":"Theoretical Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/RIVF.2009.5174652"},{"key":"20","first-page":"103","article-title":"Conflicting chip firing games on directed graphs and on treese","volume":"24","author":"pham","year":"2007","journal-title":"VNU Journal of Science Natural Sciences and Technology"},{"key":"2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/978-3-642-12090-9_31","article-title":"Algorithmic aspects of the reachability of conflicting chip firing game","volume":"283","author":"le","year":"2010","journal-title":"Studies in Computational Intelligence"},{"key":"1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/S0195-6698(13)80111-4","article-title":"Chip-firing games on graphes","volume":"12","author":"bjorner","year":"1991","journal-title":"European Journal of Combinatorics"},{"key":"10","first-page":"289","article-title":"Order structure and energy of conflicting chip firing game","volume":"35","author":"le","year":"2010","journal-title":"Acta Math Vietn"},{"journal-title":"Free Choice Petri Nets","year":"1994","author":"desel","key":"7"},{"journal-title":"On the Uniform Word Problem for Commutative Context Free Grammars","year":"1994","author":"esparza","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00231-7"},{"key":"4","first-page":"50","article-title":"Exponential space complete problems for petri nets and commutative semigroups","author":"lipton","year":"1976","journal-title":"8th Annual Symposium on Theory of Computing"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(71)80013-2"}],"event":{"name":"Communication Technologies, Research, Innovation, and Vision for the Future (RIVF)","start":{"date-parts":[[2012,2,27]]},"location":"Ho Chi Minh City, Vietnam","end":{"date-parts":[[2012,3,1]]}},"container-title":["2012 IEEE RIVF International Conference on Computing & Communication Technologies, Research, Innovation, and Vision for the Future"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6168956\/6169815\/06169852.pdf?arnumber=6169852","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T12:08:23Z","timestamp":1497960503000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6169852\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/rivf.2012.6169852","relation":{},"subject":[],"published":{"date-parts":[[2012,2]]}}}