{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:18:47Z","timestamp":1729660727871,"version":"3.28.0"},"reference-count":39,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1109\/cec.2018.8477717","type":"proceedings-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T13:12:42Z","timestamp":1542028362000},"page":"1-10","source":"Crossref","is-referenced-by-count":0,"title":["The Simulated Tree-Growth Algorithm Based on T-Invariants for State Reduction of Petri Nets"],"prefix":"10.1109","author":[{"given":"Xiong","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Li","family":"Jiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ziming","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(95)00008-L"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03845-7_19"},{"key":"ref33","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8476-2","author":"prusinkiewicz","year":"1990","journal-title":"The Algorithmic Beauty of Plants"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/0022-5193(68)90079-9","article-title":"Mathematical models for cellular interactions in development L filaments with one-sided inputs","volume":"18","author":"lindenmayer","year":"1968","journal-title":"Journal of Theoretical Biology"},{"journal-title":"Computers and Intractability A Guide to NP-Completeness","year":"1979","author":"garey","key":"ref31"},{"key":"ref30","first-page":"104","article-title":"Mathematical methods for calculating invariants in Petri nets","author":"kr\u00fcckeberg","year":"1986","journal-title":"5th European Workshop on Application and Theory of Petri Nets"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03845-7_20"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36481-1_11"},{"key":"ref35","first-page":"44","article-title":"Storage alternatives for large structured state spaces","volume":"1245","author":"ciardo","year":"1997","journal-title":"International Conference on Modelling Techniques and Tools for Computer Performance Evaluation ser Lecture Notes in Computer Science"},{"journal-title":"Optimization Analysis Using LINGO and MATLAB","year":"2014","author":"goodarzi","key":"ref34"},{"key":"ref10","first-page":"233","article-title":"Dynamic partial order reduction using probe sets","author":"kastenberg","year":"2008","journal-title":"International Conference on Concurrency Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1132960.1132962"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"journal-title":"Symbolic Model Checking An Approach to the State Explosion Problem","year":"1992","author":"mcmillan","key":"ref13"},{"key":"ref14","first-page":"83","article-title":"Improving static variable orders via invariants","author":"ciardo","year":"2007","journal-title":"International Conference on Application and Theory of Petri Nets"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1977.1101509"},{"key":"ref16","first-page":"112","article-title":"Solving the Petri nets reachability problem using the logical abstraction technique and mathematical programming","author":"bourdeaud'huy","year":"2004","journal-title":"International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming for Combinatorial Optimization Problems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.10.060"},{"journal-title":"Using Transition Invariants for Reachability Analysis of Petri Nets ser Petri Nets Theory and Applications","year":"2009","author":"kostin","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39910-0_29"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","article-title":"Linear algebraic and linear programming techniques for the analysis of place\/transition net systems","volume":"1491","author":"silva","year":"1998","journal-title":"Lectures on Petri Nets I Basic Models"},{"key":"ref4","first-page":"130","article-title":"Factored planning: From automata to Petri nets","author":"jezequel","year":"2013","journal-title":"International Conference on Application of Concurrency to System Design"},{"key":"ref27","first-page":"1344","article-title":"Heuristic algorithms for the marking construction problem of Petri nets","author":"taoka","year":"2010","journal-title":"International Symposium on Circuits and Systems"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2012.11.004"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0213029"},{"journal-title":"Discrete Mathematics and Its Applications","year":"2008","author":"rosen","key":"ref29"},{"key":"ref5","first-page":"267","article-title":"Decidability of reachability in vector addition systems","author":"kosaraju","year":"1982","journal-title":"Annual ACM Symposium on Theory of Computing"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/3-540-65306-6_21","article-title":"The state explosion problem","volume":"1491","author":"valmari","year":"1998","journal-title":"Lectures on Petri Nets I Basic Models"},{"key":"ref7","first-page":"62","article-title":"The reachability problem requires exponential space","author":"lipton","year":"1976","journal-title":"Tech Rep"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref9","first-page":"3","article-title":"My 27-year quest to overcome the state explosion problem","author":"clarke","year":"2009","journal-title":"IEEE Symposium on Logic in Computer Science"},{"journal-title":"Petri Net Theory and the Modeling of Systems","year":"1981","author":"peterson","key":"ref1"},{"key":"ref20","first-page":"435","article-title":"Combining structural and enumerative techniques for the validation of bounded Petri nets","volume":"2031","author":"delzanno","year":"2001","journal-title":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems Ser Lecture Notes in Computer Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICST.2015.7102580"},{"key":"ref21","first-page":"473","article-title":"Using Petri net invariants in state space construction","volume":"2619","author":"schmidt","year":"2003","journal-title":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems Ser Lecture Notes in Computer Science"},{"key":"ref24","first-page":"89","article-title":"An efficient genetic algorithm for reachability problems","author":"takahashi","year":"1997","journal-title":"Hawaii International Conference on System Sciences"},{"key":"ref23","doi-asserted-by":"crossref","first-page":"1359","DOI":"10.1145\/2739480.2754767","article-title":"Heuristic model checking using a Monte-Carlo tree search algorithm","author":"poulding","year":"2015","journal-title":"The Genetic and Evolutionary Computation Conference"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/978-3-642-16952-6_17","article-title":"Applying HTn heuristics in Petri nets reachability problem","author":"kultz","year":"2010","journal-title":"Advances in Artificial Intelligence - IBERAMIA 2010"},{"key":"ref25","first-page":"1904","article-title":"Planning via Petri net unfolding","author":"hickmott","year":"2007","journal-title":"International Joint Conference on Artifical Intelligence"}],"event":{"name":"2018 IEEE Congress on Evolutionary Computation (CEC)","start":{"date-parts":[[2018,7,8]]},"location":"Rio de Janeiro","end":{"date-parts":[[2018,7,13]]}},"container-title":["2018 IEEE Congress on Evolutionary Computation (CEC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8466244\/8477640\/08477717.pdf?arnumber=8477717","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T21:00:48Z","timestamp":1662411648000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8477717\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,7]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/cec.2018.8477717","relation":{},"subject":[],"published":{"date-parts":[[2018,7]]}}}