{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T08:36:33Z","timestamp":1758875793772,"version":"3.37.3"},"reference-count":61,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61402216","61573265","61973242","61673228"],"award-info":[{"award-number":["61402216","61573265","61973242","61673228"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2952056","type":"journal-article","created":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T15:58:20Z","timestamp":1573055900000},"page":"165387-165398","source":"Crossref","is-referenced-by-count":9,"title":["Estimation of Least-Cost Transition Firing Sequences in Labeled Petri Nets by Using Basis Reachability Graph"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7882-8279","authenticated-orcid":false,"given":"Hao","family":"Yue","sequence":"first","affiliation":[]},{"given":"Shulin","family":"Xu","sequence":"additional","affiliation":[]},{"given":"Guangrui","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Hesuan","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Yiyun","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Jihui","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2600583"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2019.05.021"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2018.06.319"},{"journal-title":"Deadlock resolution in automated manufacturing systems","year":"2009","author":"li","key":"ref31"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2203050"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2183358"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2907413"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2574120"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2586604"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2762823"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2598303"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1177\/0142331208100106","article-title":"Least-cost planning sequence estimation in labelled Petri nets","volume":"33","author":"li","year":"2011","journal-title":"Trans Inst Meas Control"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2585348"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2010.2070065"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2363916"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2501232"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2018.04.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2015.2504046"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2005.1583175"},{"key":"ref24","first-page":"1","article-title":"Contextual analysis of Petri nets for distributed applications","author":"jiroveanu","year":"2004","journal-title":"Proc 16th Int Symp Math Theory Netw Syst"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2587671"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2363311"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2311760"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.164"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2178023"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.06.039"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.02.043"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2796640"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2867901"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2883083"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2015.2507140"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2187890"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2011.2160452"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2521833"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2726108"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510406"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2018.04.021"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.isatra.2019.01.023"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2290314"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2523944"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2009.07.021"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cta.2018.5398"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/70.370500"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2012.2203596"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-6670(17)30768-1"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2588736"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.conengprac.2010.12.010"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2010.06.013"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2013.2289360"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2199307"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2852946"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/00207179.2015.1063164"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2620429"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2018.03.004"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2015.2405293"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2015.1098785"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2015.2401295"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2874020"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-4276-8"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894352"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08892540.pdf?arnumber=8892540","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:13Z","timestamp":1641987133000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8892540\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":61,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2952056","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}