{"id":"https://openalex.org/W2400912383","doi":"https://doi.org/10.1109/icnsc.2016.7478977","title":"Lean reachability tree for Petri net analysis","display_name":"Lean reachability tree for Petri net analysis","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2400912383","doi":"https://doi.org/10.1109/icnsc.2016.7478977","mag":"2400912383"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2016.7478977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2016.7478977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100361728","display_name":"Jun Li","orcid":"https://orcid.org/0000-0001-9514-0644"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jun Li","raw_affiliation_strings":["MOE Key Laboratory of Measurement and Control of CSE, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"MOE Key Laboratory of Measurement and Control of CSE, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084395078","display_name":"Xiaolong Yu","orcid":"https://orcid.org/0000-0003-4278-8572"},"institutions":[{"id":"https://openalex.org/I76569877","display_name":"Southeast University","ror":"https://ror.org/04ct4d772","country_code":"CN","type":"education","lineage":["https://openalex.org/I76569877"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaolong Yu","raw_affiliation_strings":["MOE Key Laboratory of Measurement and Control of CSE, Southeast University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"MOE Key Laboratory of Measurement and Control of CSE, Southeast University, Nanjing, China","institution_ids":["https://openalex.org/I76569877"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081318069","display_name":"MengChu Zhou","orcid":"https://orcid.org/0000-0002-5408-8752"},"institutions":[{"id":"https://openalex.org/I118118575","display_name":"New Jersey Institute of Technology","ror":"https://ror.org/05e74xb87","country_code":"US","type":"education","lineage":["https://openalex.org/I118118575"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MengChu Zhou","raw_affiliation_strings":["Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, US"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, New Jersey Institute of Technology, Newark, NJ, US","institution_ids":["https://openalex.org/I118118575"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100361728"],"corresponding_institution_ids":["https://openalex.org/I76569877"],"apc_list":null,"apc_paid":null,"fwci":0.3485,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65380351,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"41","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10703","display_name":"Business Process Modeling and Analysis","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11741","display_name":"Flexible and Reconfigurable Manufacturing Systems","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.9860957264900208},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.9370152950286865},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6991105675697327},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6894944906234741},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6284105181694031},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5784846544265747},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.5287736654281616},{"id":"https://openalex.org/keywords/net","display_name":"Net (polyhedron)","score":0.5163663625717163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.48184478282928467},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.4552364647388458},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37422528862953186},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3535066843032837},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.32074815034866333},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.2245243787765503},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.21722185611724854},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.16700229048728943}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9860957264900208},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.9370152950286865},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6991105675697327},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6894944906234741},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6284105181694031},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5784846544265747},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.5287736654281616},{"id":"https://openalex.org/C14166107","wikidata":"https://www.wikidata.org/wiki/Q253829","display_name":"Net (polyhedron)","level":2,"score":0.5163663625717163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.48184478282928467},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.4552364647388458},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37422528862953186},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3535066843032837},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.32074815034866333},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2245243787765503},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.21722185611724854},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.16700229048728943},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2016.7478977","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2016.7478977","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W131762947","https://openalex.org/W614929447","https://openalex.org/W627911362","https://openalex.org/W634312912","https://openalex.org/W1490850339","https://openalex.org/W1514194201","https://openalex.org/W1548737106","https://openalex.org/W1651168384","https://openalex.org/W1978320803","https://openalex.org/W1980733812","https://openalex.org/W1996191241","https://openalex.org/W2008040316","https://openalex.org/W2015160737","https://openalex.org/W2037933704","https://openalex.org/W2083567135","https://openalex.org/W2100926743","https://openalex.org/W2103504376","https://openalex.org/W2106001218","https://openalex.org/W2135051863","https://openalex.org/W2137538401","https://openalex.org/W2149781939","https://openalex.org/W2153337086","https://openalex.org/W2182981651","https://openalex.org/W2316865521","https://openalex.org/W2380814829","https://openalex.org/W4235423825","https://openalex.org/W6630618315"],"related_works":["https://openalex.org/W1980200158","https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W2522627362","https://openalex.org/W2110957508","https://openalex.org/W2353505923","https://openalex.org/W2387511021","https://openalex.org/W2095453628","https://openalex.org/W2400441765","https://openalex.org/W1531156418"],"abstract_inverted_index":{"This":[0],"work":[1],"presents":[2],"a":[3,7,23,37,57,97,107],"non-Karp-Miller":[4],"tree":[5,10,80],"called":[6],"lean":[8],"reachability":[9,27,48,90],"(LRT).":[11],"It":[12],"does":[13],"not":[14],"try":[15],"to":[16,50],"equivalently":[17],"represent":[18,87],"but":[19],"faithfully":[20,88],"express":[21],"in":[22,96,127],"finite":[24,98],"manner":[25],"the":[26,79,89,122],"set":[28,91],"of":[29,42,92,129],"an":[30,63,93],"unbounded":[31,43,52,94],"Petri":[32],"net.":[33],"First,":[34],"we":[35,55,101],"derive":[36],"sufficient":[38,108],"and":[39,45,62,72,105,132],"necessary":[40],"condition":[41,60,109],"places":[44],"some":[46],"incremental":[47],"properties":[49,104],"characterize":[51],"nets.":[53],"Then,":[54],"present":[56],"sufficiently":[58],"enabling":[59],"(SEC)":[61],"LRT":[64,85,120],"generation":[65],"algorithm.":[66],"No":[67],"fake":[68],"marking":[69,75],"is":[70,76],"produced":[71],"no":[73],"legal":[74],"lost":[77],"during":[78],"generation.":[81],"We":[82],"prove":[83,106],"that":[84,119],"can":[86],"net":[95],"manner.":[99],"Also,":[100],"examine":[102],"its":[103],"for":[110],"deadlock":[111],"checking":[112],"based":[113],"on":[114],"it.":[115],"Our":[116],"examples":[117],"show":[118],"outperforms":[121],"latest":[123],"modified":[124],"Karp-Miller":[125],"trees":[126],"terms":[128],"size,":[130],"expressiveness,":[131],"applicability.":[133]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}