{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T02:54:13Z","timestamp":1768532053152,"version":"3.49.0"},"reference-count":40,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"published-print":{"date-parts":[[2022,3,4]]},"DOI":"10.1080\/17445760.2021.1991340","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T17:23:01Z","timestamp":1636392181000},"page":"167-186","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":6,"title":["From strong to exact Petri net computers"],"prefix":"10.1080","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5698-7324","authenticated-orcid":false,"given":"Dmitry A.","family":"Zaitsev","sequence":"first","affiliation":[{"name":"Department of Information Technology, University of Information Technology and Management in Rzesz\u00f3w, Rzeszow, Poland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5408-8752","authenticated-orcid":false,"given":"MengChu","family":"Zhou","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering , New Jersey Institute of Technology, Newark, NJ, USA"}]}],"member":"301","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"CIT0001","unstructured":"Lipton RJ. The reachability problem requires exponential space. Tech. Rep., 1976. [Online]. Available from: http:\/\/www.cs.yale.edu\/publications\/techreports\/tr63.pdf."},{"issue":"9","key":"CIT0002","first-page":"2574","volume":"47","author":"Ding Z","year":"2017","journal-title":"IEEE Trans Syst Man Cyber Syst"},{"issue":"9","key":"CIT0003","first-page":"2601","volume":"47","author":"Yang R","year":"2017","journal-title":"IEEE Trans Syst Man Cyber Syst"},{"key":"CIT0004","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2347933"},{"key":"CIT0005","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2012.2237549"},{"issue":"1","key":"CIT0006","first-page":"7","volume":"21","author":"Alhazov A","year":"2016","journal-title":"J Autom Lang Comb"},{"key":"CIT0007","doi-asserted-by":"publisher","DOI":"10.1109\/DCABES.2013.14"},{"key":"CIT0008","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCA.2012.2192266"},{"key":"CIT0009","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2017.7510772"},{"key":"CIT0010","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2855685"},{"key":"CIT0011","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2016.2598303"},{"key":"CIT0012","first-page":"374","volume":"1491","author":"Esparza J.","year":"1996","journal-title":"LNCS"},{"key":"CIT0013","doi-asserted-by":"publisher","DOI":"10.1109\/5.24143"},{"key":"CIT0014","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(69)80011-5"},{"key":"CIT0015","first-page":"62","volume":"616","author":"Barkaoui K","year":"1992","journal-title":"LNCS"},{"key":"CIT0016","unstructured":"Zaitsev DA. Generator of Petri nets which count double exponent after R.J. Lipton and J. Esparza constructs. 16 June 2016. [Online]. Available from: https:\/\/github.com\/dazeorgacm\/depn."},{"key":"CIT0017","first-page":"3","volume":"85","author":"Zaitsev D.","year":"2016","journal-title":"Petri Net Newsletter"},{"key":"CIT0018","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2016.02.016"},{"key":"CIT0019","doi-asserted-by":"publisher","DOI":"10.1080\/00207540412331312688"},{"key":"CIT0020","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.008"},{"key":"CIT0021","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316369"},{"key":"CIT0022","volume-title":"Petri net theory and the modeling of systems","author":"Petersen J.","year":"1981"},{"key":"CIT0023","volume-title":"Computation: finite and infinite machines","author":"Minsky ML.","year":"1967"},{"key":"CIT0024","volume-title":"Introduction to automata theory, languages, and computation","author":"Hopcroft J","year":"2014","edition":"3"},{"key":"CIT0025","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-11981-7_5"},{"key":"CIT0026","doi-asserted-by":"publisher","DOI":"10.2172\/4242290"},{"key":"CIT0027","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75596-8_37"},{"key":"CIT0028","doi-asserted-by":"publisher","DOI":"10.1002\/9781119069706"},{"key":"CIT0029","unstructured":"Baker Jr. HG. Rabin's proof of the undecidability of the reachability set inclusion problem of vector addition systems Computation Structures Group Memo 79, Project MAC, M.I.T, Cambridge, Mass, July 1973."},{"key":"CIT0030","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90008-6"},{"key":"CIT0031","doi-asserted-by":"publisher","DOI":"10.1080\/00207160.2017.1283410"},{"key":"CIT0032","doi-asserted-by":"publisher","DOI":"10.25088\/ComplexSystems.26.2.157"},{"key":"CIT0033","doi-asserted-by":"crossref","unstructured":"Cervesato I, Durgin N, Mitchell J, et\u00a0al. Relating strands and multiset rewriting for security protocol analysis. In Proceedings 13th IEEE Computer Security Foundations Workshop (CSFW-13), 2000 Jul, p. 35\u201351.","DOI":"10.1109\/CSFW.2000.856924"},{"key":"CIT0034","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2019.1911486"},{"key":"CIT0035","doi-asserted-by":"publisher","DOI":"10.25088\/ComplexSystems.26.4.341"},{"key":"CIT0036","first-page":"46","volume":"7400","author":"Hillah L","year":"2012","journal-title":"LNCS"},{"key":"CIT0037","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2017.2692262"},{"key":"CIT0038","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2018.2876343"},{"key":"CIT0039","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003096"},{"key":"CIT0040","doi-asserted-by":"publisher","DOI":"10.1109\/JAS.2020.1003003"}],"container-title":["International Journal of Parallel, Emergent and Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/17445760.2021.1991340","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:26:33Z","timestamp":1726082793000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/17445760.2021.1991340"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,3,4]]}},"alternative-id":["10.1080\/17445760.2021.1991340"],"URL":"https:\/\/doi.org\/10.1080\/17445760.2021.1991340","relation":{},"ISSN":["1744-5760","1744-5779"],"issn-type":[{"value":"1744-5760","type":"print"},{"value":"1744-5779","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=gpaa20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2021-10-05","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-10-06","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-11-08","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}