{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T10:16:11Z","timestamp":1756894571922,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2967342","type":"journal-article","created":{"date-parts":[[2020,1,17]],"date-time":"2020-01-17T21:06:26Z","timestamp":1579295186000},"page":"22854-22861","source":"Crossref","is-referenced-by-count":9,"title":["Genetic-Based Approach for Minimum Initial Marking Estimation in Labeled Petri Nets"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3696-8078","authenticated-orcid":false,"given":"Hichem","family":"Kmimech","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5823-4641","authenticated-orcid":false,"given":"Achraf Jabeur","family":"Telmoudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Layth","family":"Sliman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lotfi","family":"Nabli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"326","article-title":"Marking estimation of Petri nets based on partial observation","volume":"1","author":"giua","year":"2004","journal-title":"Proc Amer Control Conf"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2007.904281"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377182"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2019\/2895685"},{"article-title":"Online fault diagnosis of discrete event systems modeled with labeled Petri nets using an overall fault status","year":"2018","author":"zhu","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2592952"},{"key":"ref16","first-page":"245","article-title":"A heuristic algorithm for the minimum initial marking problem of Petri nets","volume":"1","author":"yamauchi","year":"2002","journal-title":"Proc IEEE Int Conf Syst Man Cybern Comput Simul"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2014.7040445"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2894352"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2002.802769"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2000.884458"},{"key":"ref3","first-page":"1407","article-title":"The minimum initial marking problem for scheduling in timed Petri nets","volume":"75","author":"watanabe","year":"1992","journal-title":"IEICE Trans Fundam Electron Commun Comput Sci"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.1240"},{"key":"ref5","first-page":"1390","article-title":"Minimum initial marking problems of Petri nets","volume":"72","author":"watanabe","year":"1989","journal-title":"IEICE Trans"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0577-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/2.294849"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2203050"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-005-5239-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1997.652507"},{"article-title":"Genetic algorithms in timetabling and scheduling","year":"1994","author":"fang","key":"ref22"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"ref21"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/08962088.pdf?arnumber=8962088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:56:06Z","timestamp":1642002966000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8962088\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2967342","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}