{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T23:26:45Z","timestamp":1766446005487,"version":"3.48.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T00:00:00Z","timestamp":1760400000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100003141","name":"Consejo Nacional de Humanidades, Ciencias y Tecnolog\u00edas","doi-asserted-by":"publisher","award":["778009"],"award-info":[{"award-number":["778009"]}],"id":[{"id":"10.13039\/501100003141","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    The enhancement of cyclic Petri nets (PN) identified from a set S of event sequences generated by discrete event processes is addressed. The refinement aims to yield a model that accurately describes the sequencing of job execution and represents a low surplus language. A novel method that extends discovery methods for concurrent repetitive processes dealing with long sequences of events that include all variants process behaviour, is presented. Given a PN\n                    <jats:italic>N<\/jats:italic>\n                    and its set of minimal t-invariants Y, the method analyses the execution of the t-components in every sequence in S; it determines patterns of representative transitions S\n                    <jats:sub>Y<\/jats:sub>\n                    that schedule the execution of t-components in\n                    <jats:italic>N<\/jats:italic>\n                    . Afterwards, S\n                    <jats:sub>Yi<\/jats:sub>\n                    are treated to identify a new PN\n                    <jats:italic>N<\/jats:italic>\n                    \u2019 that uses S\n                    <jats:sub>Y<\/jats:sub>\n                    and new places;\n                    <jats:italic>N<\/jats:italic>\n                    \u2019 schedules the occurrence of representative transitions in\n                    <jats:italic>N<\/jats:italic>\n                    . The enhanced model\n                    <jats:italic>N<\/jats:italic>\n                    \u2019\u2019 is obtained by merging the representative transitions of both\n                    <jats:italic>N<\/jats:italic>\n                    and\n                    <jats:italic>N<\/jats:italic>\n                    \u2019.\n                  <\/jats:p>","DOI":"10.1007\/s10626-025-00422-9","type":"journal-article","created":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T15:57:37Z","timestamp":1760457457000},"page":"335-354","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Enhancement of Petri nets identified from discrete-event processes by scheduling t-components"],"prefix":"10.1007","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0880-7098","authenticated-orcid":false,"given":"Ernesto","family":"L\u00f3pez-Mellado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-8853-1286","authenticated-orcid":false,"given":"Yolanda","family":"\u00c1lvarez-P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,14]]},"reference":[{"key":"422_CR2","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin D (1988) Queries and concept learning. Mach Learn 2:319\u2013342","journal-title":"Mach Learn"},{"issue":"4","key":"422_CR3","doi-asserted-by":"publisher","first-page":"686","DOI":"10.1109\/TKDE.2018.2841877","volume":"31","author":"A Augusto","year":"2019","unstructured":"Augusto A, Conforti R, Dumas M, La Rosa M, Maggi FM, Marrella A, Mecella M, Soo A (2019) Automated discovery of process models from event logs: review and benchmark. IEEE Trans Knowl Data Eng 31(4):686\u2013705. https:\/\/doi.org\/10.1109\/TKDE.2018.2841877","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"422_CR4","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1109\/TASE.2019.2944299","volume":"17","author":"F Basile","year":"2020","unstructured":"Basile F, Faraut G, Ferrara L, Lesage J (2020) An optimization-based approach to discover the unobservable behavior of a discrete-event system through interpreted petri nets. IEEE Trans Autom Sci Eng 17(2):784\u2013798. https:\/\/doi.org\/10.1109\/TASE.2019.2944299","journal-title":"IEEE Trans Autom Sci Eng"},{"issue":"1","key":"422_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0218843014400012","volume":"23","author":"JCAM Buijs","year":"2014","unstructured":"Buijs JCAM, van Dongen BF, van der Aalst WMP (2014) Quality dimensions in process discovery: the importance of fitness, precision, generalization and simplicity. Int J Coop Inf Syst 23(1):1\u201339","journal-title":"Int J Coop Inf Syst"},{"issue":"4","key":"422_CR6","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s10626-007-0025-0","volume":"17","author":"MP Cabasino","year":"2007","unstructured":"Cabasino MP, Giua A, Seatzu C (2007) Identification of petri nets from knowledge of their language. Discret Event Dyn Syst 17(4):447\u2013474","journal-title":"Discret Event Dyn Syst"},{"key":"422_CR7","unstructured":"Cabasino MP, Darondeau P, Fanti MP, Seatzu C (2013) Model identification and synthesis of discrete-event systems. In: Contemporary issues in systems science and eng., IEEE\/Wiley press book series"},{"key":"422_CR8","doi-asserted-by":"crossref","unstructured":"David R, Alla H (2010) Discrete, continuous, and hybrid petri nets. 2nd Edition. Springer-Verlag Berlin Heidelberg","DOI":"10.1007\/978-3-642-10669-9"},{"issue":"9","key":"422_CR9","doi-asserted-by":"publisher","first-page":"958","DOI":"10.1016\/j.conengprac.2010.09.004","volume":"19","author":"M Dotoli","year":"2011","unstructured":"Dotoli M, Pia Fanti M, Mangini AM, Ukovich W (2011) Identification of the unobservable behaviour of industrial automation systems by petri nets. Control Eng Pract 19(9):958\u2013966","journal-title":"Control Eng Pract"},{"issue":"3","key":"422_CR11","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1080\/00207721.2012.724098","volume":"45","author":"AP Estrada-Vargas","year":"2014","unstructured":"Estrada-Vargas AP, L\u00f3pez-Mellado E, Lesage J-J (2014) Input\u2013output identification of controlled discrete manufacturing systems. Int J Syst Sci 45(3):456\u2013471. https:\/\/doi.org\/10.1080\/00207721.2012.724098","journal-title":"Int J Syst Sci"},{"issue":"3","key":"422_CR12","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1109\/TASE.2015.2445332","volume":"14","author":"AP Estrada-Vargas","year":"2017","unstructured":"Estrada-Vargas AP, Lopez-Mellado E, Lesage J-J (2017) A black-box identification method for automated discrete-event systems. IEEE Trans Automat Sci Eng 14(3):1321\u20131336","journal-title":"IEEE Trans Automat Sci Eng"},{"issue":"5","key":"422_CR13","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"ME Gold","year":"1967","unstructured":"Gold ME (1967) Language identification in the limit. Inf Control 10(5):447\u2013474","journal-title":"Inf Control"},{"key":"422_CR14","unstructured":"L\u00f3pez-Mellado E, Tapia-Flores T (2017) Refining discovered petri nets by sequencing repetitive components. In: International workshop on algorithms and theories for the analysis of event data ATAED@PetriNets\/ACSD 2017, Zaragoza, Spain, pp 131\u2013138"},{"issue":"4","key":"422_CR15","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata T (1989) Petri nets: properties, analysis and applications. Proc IEEE 77(4):541\u2013580. https:\/\/doi.org\/10.1109\/5.24143","journal-title":"Proc IEEE"},{"issue":"2","key":"422_CR17","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1109\/TASE.2017.2718244","volume":"15","author":"J Saives","year":"2018","unstructured":"Saives J, Faraut G, Lesage J (2018) Automated partitioning of concurrent discrete-event systems for distributed behavioral identification. IEEE Trans Autom Sci Eng 15(2):832\u2013841. https:\/\/doi.org\/10.1109\/TASE.2017.2718244","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"422_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00236-023-00445-5","volume":"61","author":"T Tapia-Flores","year":"2024","unstructured":"Tapia-Flores T, L\u00f3pez-Mellado E (2024) Discovering workflow nets of concurrent iterative processes. Acta Inform 61:1\u201321. https:\/\/doi.org\/10.1007\/s00236-023-00445-5","journal-title":"Acta Inform"},{"issue":"3","key":"422_CR19","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1109\/TASE.2017.2682060","volume":"15","author":"T Tapia-Flores","year":"2018","unstructured":"Tapia-Flores T, L\u00f3pez-Mellado E, Estrada-Vargas AP, Lesage J-J (2018) Discovering petri net models of discrete-event processes by computing T-invariants. IEEE Trans Autom Sci Eng 15(3):992\u20131003. https:\/\/doi.org\/10.1109\/TASE.2017.2682060","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"422_CR20","doi-asserted-by":"crossref","unstructured":"van der Aalst W, Carmona J (2022) \u201cProcess Mining Handbook\u201d in lecture notes in business information processing Springer","DOI":"10.1007\/978-3-031-08848-3"},{"key":"422_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19345-3","volume-title":"Process mining: discovery, \u201cConformance and Enhancement of Business Processes\u201d","author":"W van der Aalst","year":"2011","unstructured":"van der Aalst W (2011) Process mining: discovery, \u201cConformance and Enhancement of Business Processes.\u201d Springer-Verlag, Berlin"},{"key":"422_CR22","doi-asserted-by":"publisher","unstructured":"Wen L, Wang J, Sun J (2006) Detecting implicit dependencies between tasks from event logs. In: Zhou X, Li J, Shen HT, Kitsuregawa M, Zhang Y (eds) Frontiers of WWW research and development - APWeb 2006. APWeb 2006. Lecture notes in computer science, vol 3841. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/11610113_52","DOI":"10.1007\/11610113_52"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-025-00422-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10626-025-00422-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-025-00422-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T23:22:06Z","timestamp":1766445726000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10626-025-00422-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,14]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["422"],"URL":"https:\/\/doi.org\/10.1007\/s10626-025-00422-9","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"type":"print","value":"0924-6703"},{"type":"electronic","value":"1573-7594"}],"subject":[],"published":{"date-parts":[[2025,10,14]]},"assertion":[{"value":"9 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}