{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T21:10:01Z","timestamp":1737234601566,"version":"3.33.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T00:00:00Z","timestamp":1699228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s11704-023-3381-5","type":"journal-article","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T05:01:29Z","timestamp":1699246889000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A perspective on Petri Net learning"],"prefix":"10.1007","volume":"17","author":[{"given":"Hongda","family":"Qi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Changjun","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,6]]},"reference":[{"issue":"1","key":"3381_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(76)90008-6","volume":"2","author":"M Hack","year":"1976","unstructured":"Hack M. The equality problem for vector addition systems is undecidable. Theoretical Computer Science, 1976, 2(1): 77\u201395","journal-title":"Theoretical Computer Science"},{"issue":"7587","key":"3381_CR2","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver D, Huang A, Maddison C J, Guez A, Sifre L, van den Driessche G, Schrittwieser J, Antonoglou I, Panneershelvam V, Lanctot M, Dieleman S, Grewe D, Nham J, Kalchbrenner N, Sutskever I, Lillicrap T, Leach M, Kavukcuoglu K, Graepel T, Hassabis D. Mastering the game of Go with deep neural networks and tree search. Nature, 2016, 529(7587): 484\u2013489","journal-title":"Nature"},{"issue":"7873","key":"3381_CR3","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1038\/s41586-021-03819-2","volume":"596","author":"J Jumper","year":"2021","unstructured":"Jumper J, Evans R, Pritzel A, Green T, Figurnov M, Ronneberger O, Tunyasuvunakool K, Bates R, \u017d\u00eddek A, Potapenko A, Bridgland A, Meyer C, Kohl S A A, Ballard A J, Cowie A, Romera-Paredes B, Nikolov S, Jain R, Adler J, Back T, Petersen S, Reiman D, Clancy E, Zielinski M, Steinegger M, Pacholska M, Berghammer T, Bodenstein S, Silver D, Vinyals O, Senior A W, Kavukcuoglu K, Kohli P, Hassabis D. Highly accurate protein structure prediction with AlphaFold. Nature, 2021, 596(7873): 583\u2013589","journal-title":"Nature"},{"key":"3381_CR4","unstructured":"Ouyang L, Wu J, Jiang X, Almeida D, Wainwright C L, Mishkin P, Zhang C, Agarwal S, Slama K, Ray A, Schulman J, Hilton J, Kelton F, Miller L, Simens M, Askell A, Welinder P, Christiano P, Leike J, Lowe R. Training language models to follow instructions with human feedback. In: Proceedings of the 36th Conference on Neural Information Processing Systems. 2022, 27730\u201327744"},{"key":"3381_CR5","doi-asserted-by":"crossref","unstructured":"Wang S, Zhou M, Gan M, You D, Li Y. New reachability trees for unbounded Petri nets. In: Proceedings of 2015 IEEE International Conference on Robotics and Automation. 2015, 3862\u20133867","DOI":"10.1109\/ICRA.2015.7139737"},{"issue":"12","key":"3381_CR6","doi-asserted-by":"publisher","first-page":"7380","DOI":"10.1109\/TNNLS.2021.3084902","volume":"33","author":"J Wang","year":"2022","unstructured":"Wang J, Qi H, Guang M, Zhang C, Yan C, Jiang C. Net learning. IEEE Transactions on Neural Networks and Learning Systems, 2022, 33(12): 7380\u20137389","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"3381_CR7","doi-asserted-by":"publisher","unstructured":"Qi H, Guang M, Wang J, Yan C, Jiang C. Probabilistic reachability prediction of unbounded Petri nets: a machine learning method. IEEE Transactions on Automation Science and Engineering, 2023, doi: https:\/\/doi.org\/10.1109\/TASE.2023.3272983","DOI":"10.1109\/TASE.2023.3272983"},{"key":"3381_CR8","doi-asserted-by":"crossref","unstructured":"Guang M, Yan C, Wang J, Qi H, Jiang C. Benchmark datasets for stochastic Petri net learning. In: Proceedings of 2021 International Joint Conference on Neural Networks. 2021, 1\u20138","DOI":"10.1109\/IJCNN52387.2021.9533785"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3381-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-023-3381-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-023-3381-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T20:42:37Z","timestamp":1737232957000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-023-3381-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,6]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["3381"],"URL":"https:\/\/doi.org\/10.1007\/s11704-023-3381-5","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2023,11,6]]},"assertion":[{"value":"7 May 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 November 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics"}}],"article-number":"176351"}}