{"id":"https://openalex.org/W2045242187","doi":"https://doi.org/10.1109/icnsc.2013.6548717","title":"Scheduling timed Petri nets with a time-feasible reachability tree","display_name":"Scheduling timed Petri nets with a time-feasible reachability tree","publication_year":2013,"publication_date":"2013-04-01","ids":{"openalex":"https://openalex.org/W2045242187","doi":"https://doi.org/10.1109/icnsc.2013.6548717","mag":"2045242187"},"language":"en","primary_location":{"id":"doi:10.1109/icnsc.2013.6548717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2013.6548717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 10th IEEE 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/A5100439521","display_name":"Hyun-Jung Kim","orcid":"https://orcid.org/0000-0002-5247-1395"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Hyun-Jung Kim","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100366235","display_name":"Jun-Ho Lee","orcid":"https://orcid.org/0000-0001-7693-8896"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jun-Ho Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014167840","display_name":"Tae\u2010Eog Lee","orcid":"https://orcid.org/0000-0003-0885-6359"},"institutions":[{"id":"https://openalex.org/I157485424","display_name":"Korea Advanced Institute of Science and Technology","ror":"https://ror.org/05apxxy63","country_code":"KR","type":"education","lineage":["https://openalex.org/I157485424"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Tae-Eog Lee","raw_affiliation_strings":["Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Systems Engineering, Korea Advanced Institute of Science and Technology, Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]},{"raw_affiliation_string":"Dept. of Ind. & Syst. Eng., Korea Adv. Inst. of Sci. & Technol. (KAIST), Daejeon, South Korea","institution_ids":["https://openalex.org/I157485424"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5100439521"],"corresponding_institution_ids":["https://openalex.org/I157485424"],"apc_list":null,"apc_paid":null,"fwci":0.7251,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.72751602,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"17","issue":null,"first_page":"94","last_page":"99"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":1.0,"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":1.0,"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.9983999729156494,"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/T10142","display_name":"Formal Methods in Verification","score":0.9966999888420105,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8721436262130737},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.8601757287979126},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7642090320587158},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.642349898815155},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.565510094165802},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.4858414828777313},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4627184271812439},{"id":"https://openalex.org/keywords/stochastic-petri-net","display_name":"Stochastic Petri net","score":0.42929011583328247},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41486436128616333},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37576842308044434},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.36560532450675964},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.30725187063217163},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2632032632827759},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2548900544643402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1701141893863678},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08882230520248413}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8721436262130737},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.8601757287979126},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7642090320587158},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.642349898815155},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.565510094165802},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.4858414828777313},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4627184271812439},{"id":"https://openalex.org/C197551870","wikidata":"https://www.wikidata.org/wiki/Q7617809","display_name":"Stochastic Petri net","level":3,"score":0.42929011583328247},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41486436128616333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37576842308044434},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.36560532450675964},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.30725187063217163},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2632032632827759},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2548900544643402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1701141893863678},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08882230520248413},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icnsc.2013.6548717","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icnsc.2013.6548717","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 10th IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL (ICNSC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.7799999713897705,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W23112316","https://openalex.org/W1519324376","https://openalex.org/W1527132796","https://openalex.org/W1983788549","https://openalex.org/W1996109622","https://openalex.org/W2009441467","https://openalex.org/W2016738003","https://openalex.org/W2019027929","https://openalex.org/W2039104801","https://openalex.org/W2096110679","https://openalex.org/W2110050374","https://openalex.org/W2110629569","https://openalex.org/W2112161942","https://openalex.org/W2115448177","https://openalex.org/W2128805196","https://openalex.org/W2129855961","https://openalex.org/W2130561017","https://openalex.org/W2141103600","https://openalex.org/W2143593195","https://openalex.org/W2144265184","https://openalex.org/W2158814988","https://openalex.org/W6631466428","https://openalex.org/W6676588952"],"related_works":["https://openalex.org/W1500907979","https://openalex.org/W2039577724","https://openalex.org/W2380814829","https://openalex.org/W1551903405","https://openalex.org/W1980200158","https://openalex.org/W2154794415","https://openalex.org/W2107824370","https://openalex.org/W1531156418","https://openalex.org/W2353505923","https://openalex.org/W2141183298"],"abstract_inverted_index":{"We":[0],"examine":[1],"a":[2,10,15,18,22,35,39,42,69,74,78,108,120,135,139,164,167,189,203],"timed":[3],"Petri":[4,122],"net":[5,123],"(TPN)":[6],"scheduling":[7,212],"problem":[8,30],"with":[9,68,91],"time-feasible":[11],"reachability":[12,109,140],"tree.":[13,110],"Scheduling":[14],"TPN":[16,75],"includes":[17],"sequencing":[19,28],"decision":[20,24,29],"and":[21,208,214,225],"timing":[23],"of":[25,38,85,101,154,222],"transitions.":[26],"The":[27],"is":[31,56,76,115,126],"equivalent":[32],"to":[33,129,162,183,202],"determining":[34],"routing":[36,80],"order":[37],"token":[40,79],"in":[41,94,166,188],"conflict":[43],"place.":[44],"Each":[45],"transition":[46],"usually":[47],"fires":[48],"as":[49,51],"soon":[50],"possible":[52,99],"when":[53],"its":[54,216],"sequence":[55,81,153],"determined":[57],"because":[58,156],"such":[59,185],"an":[60,65,131,170],"earliest":[61,194],"firing":[62,152,195],"policy":[63],"provides":[64],"optimal":[66,132,171],"solution":[67,133],"regular":[70],"objective":[71],"measure.":[72],"When":[73],"constructed,":[77],"or":[82],"the":[83,86,95,102,112,150,175,193,200,220,226],"evolution":[84],"system":[87,103],"can":[88,104],"be":[89,105],"described":[90],"marking":[92,158],"changes":[93],"model.":[96],"Therefore,":[97,178],"all":[98],"behaviors":[100],"tracked":[106],"by":[107],"However,":[111],"tree":[113,141,168,190],"size":[114],"so":[116],"large":[117],"for":[118,169],"even":[119],"small":[121],"that":[124,146],"it":[125],"very":[127],"difficult":[128],"obtain":[130],"within":[134],"reasonable":[136],"time.":[137],"Moreover,":[138],"has":[142],"many":[143],"time-infeasible":[144,186],"paths":[145,187],"do":[147],"not":[148],"indicate":[149],"actual":[151],"transitions":[155],"only":[157],"states":[159],"are":[160],"considered":[161],"generate":[163],"node":[165],"schedule":[172],"while":[173],"ignoring":[174],"enabled":[176],"epochs.":[177],"we":[179,198],"develop":[180],"efficient":[181],"properties":[182],"eliminate":[184],"based":[191,218],"on":[192,219],"policy.":[196],"Then":[197],"apply":[199],"method":[201],"simple":[204],"3\u00d73":[205],"flow":[206],"shop":[207],"linear":[209],"cluster":[210],"tool":[211],"problems,":[213],"verify":[215],"effectiveness":[217],"number":[221],"searched":[223],"nodes":[224],"computation":[227],"times.":[228]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}