{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T08:13:10Z","timestamp":1743063190043,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662681909"},{"type":"electronic","value":"9783662681916"}],"license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-662-68191-6_1","type":"book-chapter","created":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T06:02:02Z","timestamp":1698732122000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Toolchain to\u00a0Compute Concurrent Places of\u00a0Petri Nets"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5969-7346","authenticated-orcid":false,"given":"Nicolas","family":"Amat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Bouvier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hubert","family":"Garavel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,11,1]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-030-76983-3_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"N Amat","year":"2021","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: On the combination of polyhedral abstraction and SMT-based model checking for Petri nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 164\u2013185. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_9"},{"key":"1_CR2","doi-asserted-by":"publisher","unstructured":"Amat, N., Berthomieu, B., Dal Zilio, S.: A polyhedral abstraction for Petri Nets and its application to SMT-based model checking. Fund. Inform. 187(2\u20134), 103\u2013138 (2022). https:\/\/doi.org\/10.3233\/FI-222134, publisher: IOS Press","DOI":"10.3233\/FI-222134"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-031-06653-5_6","volume-title":"Application and Theory of Petri Nets and Concurrency - PETRI NETS 2022","author":"N Amat","year":"2022","unstructured":"Amat, N., Chauvet, L.: Kong: a tool to squash concurrent places. In: Bernardinello, L., Petrucci, L. (eds.) PETRI NETS 2022. LNCS, vol. 13288, pp. 115\u2013126. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06653-5_6"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-031-27481-7_25","volume-title":"Formal Methods - FM 2023","author":"N Amat","year":"2023","unstructured":"Amat, N., Dal Zilio, S.: SMPT: a testbed for reachabilty methods in generalized Petri nets. In: Chechik, M., Katoen, J.P., Leucker, M. (eds.) FM 2023. LNCS, vol. 14000, pp. 445\u2013453. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27481-7_25"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-84629-9_3","volume-title":"Model Checking Software","author":"N Amat","year":"2021","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Accelerating the computation of dead and concurrent places using reductions. In: Laarman, A., Sokolova, A. (eds.) SPIN 2021. LNCS, vol. 12864, pp. 45\u201362. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84629-9_3"},{"key":"1_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-022-00694-8","author":"N Amat","year":"2022","unstructured":"Amat, N., Dal Zilio, S., Le Botlan, D.: Leveraging polyhedral reductions for solving Petri net reachability problems. Int. J. Softw. Tools Technol. Transfer (2022). https:\/\/doi.org\/10.1007\/s10009-022-00694-8","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Amparore, E., et al.: Presentation of the 9th edition of the model checking contest. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 50\u201368. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_4","DOI":"10.1007\/978-3-030-17502-3_4"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/978-3-540-47919-2_13","volume-title":"Petri Nets: Central Models and Their Properties","author":"G Berthelot","year":"1987","unstructured":"Berthelot, G.: Transformations and decompositions of nets. In: Brauer, W., Reisig, W., Rozenberg, G. (eds.) ACPN 1986. LNCS, vol. 254, pp. 359\u2013376. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/978-3-540-47919-2_13"},{"key":"1_CR9","doi-asserted-by":"publisher","unstructured":"Berthomieu, B., Ribet, P.O., Vernadat, F.: The tool TINA - construction of abstract state spaces for Petri nets and time Petri nets. Int. J. Prod. Res. 42(14) (2004).https:\/\/doi.org\/10.1080\/00207540412331312688","DOI":"10.1080\/00207540412331312688"},{"key":"1_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-030-76983-3_17","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P Bouvier","year":"2021","unstructured":"Bouvier, P., Garavel, H.: Efficient algorithms for three reachability problems in safe Petri nets. In: Buchs, D., Carmona, J. (eds.) PETRI NETS 2021. LNCS, vol. 12734, pp. 339\u2013359. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-76983-3_17"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-51831-8_1","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"P Bouvier","year":"2020","unstructured":"Bouvier, P., Garavel, H., Ponce-de-Le\u00f3n, H.: Automatic decomposition of Petri nets into automata networks \u2013 a synthetic account. In: Janicki, R., Sidorova, N., Chatain, T. (eds.) PETRI NETS 2020. LNCS, vol. 12152, pp. 3\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51831-8_1"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-319-19488-2_9","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"H Garavel","year":"2015","unstructured":"Garavel, H.: Nested-unit Petri nets: a structural means to increase efficiency and scalability of verification on elementary nets. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 179\u2013199. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19488-2_9"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.jlamp.2018.11.005","volume":"104","author":"H Garavel","year":"2019","unstructured":"Garavel, H.: Nested-unit Petri nets. J. Logical Algebraic Methods Program. 104, 60\u201385 (2019)","journal-title":"J. Logical Algebraic Methods Program."},{"key":"1_CR14","unstructured":"Garavel, H.: Proposal for adding useful features to Petri-net model checkers. Technical report, abs\/2101.05024, arXiv Computing Research Repository, December 2020. https:\/\/hal.inria.fr\/hal-03087421"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10009-012-0244-z","volume":"15","author":"H Garavel","year":"2013","unstructured":"Garavel, H., Lang, F., Mateescu, R., Serwe, W.: CADP 2011: a toolbox for the construction and analysis of distributed processes. Springer Int. J. Softw. Tools Technol. Transf. (STTT) 15(2), 89\u2013107 (2013)","journal-title":"Springer Int. J. Softw. Tools Technol. Transf. (STTT)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-68270-9_1","volume-title":"ModelEd, TestEd, TrustEd","author":"H Garavel","year":"2017","unstructured":"Garavel, H., Lang, F., Serwe, W.: From LOTOS to LNT. In: Katoen, J.-P., Langerak, R., Rensink, A. (eds.) ModelEd, TestEd, TrustEd. LNCS, vol. 10500, pp. 3\u201326. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68270-9_1"},{"issue":"2","key":"1_CR17","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/j.tcs.2005.09.064","volume":"351","author":"H Garavel","year":"2006","unstructured":"Garavel, H., Serwe, W.: State space reduction for process algebra specifications. Theoret. Comput. Sci. 351(2), 131\u2013145 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR18","unstructured":"Garavel, H., Sifakis, J.: Compilation and verification of LOTOS specifications. In: Logrippo, L., Probert, R.L., Ural, H. (eds.) Proceedings of the 10th IFIP International Symposium on Protocol Specification, Testing and Verification (PSTV\u201990), Ottawa, Canada, pp. 379\u2013394. North-Holland, June 1990"},{"key":"1_CR19","doi-asserted-by":"publisher","unstructured":"Giua, A., DiCesare, F., Silva, M.: Generalized mutual exclusion constraints on nets with uncontrollable transitions. In: IEEE International Conference on Systems, Man, and Cybernetics. IEEE (1992). https:\/\/doi.org\/10.1109\/ICSMC.1992.271666","DOI":"10.1109\/ICSMC.1992.271666"},{"key":"1_CR20","unstructured":"IEC: GRAFCET specification language for sequential function charts. International Standard 60848:2013, International Electrotechnical Commission, Geneva, February 2013"},{"key":"1_CR21","unstructured":"ISO\/IEC: LOTOS - A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour. International Standard 8807, International Organization for Standardization - Information Processing Systems - Open Systems Interconnection, Geneva, September 1989"},{"key":"1_CR22","unstructured":"ISO\/IEC: High-level Petri Nets - Part 2: Transfer Format. International Standard 15909\u20132:2011, International Organization for Standardization - Information Technology - Systems and Software Engineering, Geneva (2011)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0304-3975(84)90014-8","volume":"29","author":"R Janicki","year":"1984","unstructured":"Janicki, R.: Nets, sequential components and concurrency relations. Theoret. Comput. Sci. 29, 87\u2013121 (1984)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR24","unstructured":"Karatkevich, A.: Conditions of SM-coverability of Petri nets, September 2012. https:\/\/www.researchgate.net\/publication\/267508814_Conditions_of_SM-Coverability_of_Petri_Nets"},{"key":"1_CR25","unstructured":"Kordon, F., et al.: Complete Results for the 2021 Edition of the Model Checking Contest, June 2021. http:\/\/mcc.lip6.fr\/2021\/results.php"},{"key":"1_CR26","unstructured":"Kordon, F., et al.: Complete Results for the 2022 Edition of the Model Checking Contest, June 2022. https:\/\/mcc.lip6.fr\/2022\/results.php"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/3-540-55676-1_17","volume-title":"Application and Theory of Petri Nets 1992","author":"AV Kovalyov","year":"1992","unstructured":"Kovalyov, A.V.: Concurrency relations and the safety problem for Petri nets. In: Jensen, K. (ed.) ICATPN 1992. LNCS, vol. 616, pp. 299\u2013309. Springer, Heidelberg (1992). https:\/\/doi.org\/10.1007\/3-540-55676-1_17"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-1-4757-3143-9_6","volume-title":"Hardware Design and Petri Nets","author":"A Kovalyov","year":"2000","unstructured":"Kovalyov, A.: A polynomial algorithm to compute the concurrency relation of a regular STG. In: Yakovlev, A., Gomes, L., Lavagno, L. (eds.) Hardware Design and Petri Nets, pp. 107\u2013126. Springer, Boston (2000). https:\/\/doi.org\/10.1007\/978-1-4757-3143-9_6"},{"key":"1_CR29","unstructured":"Kovalyov, A., Esparza, J.: A polynomial algorithm to compute the concurrency relation of free-choice signal transition graphs. In: Proceedings of the 3rd Workshop on Discrete Event Systems (WODES\u201996), Edinburgh, Scotland, UK, pp. 1\u20136 (1996)"},{"key":"1_CR30","doi-asserted-by":"publisher","unstructured":"Murata, T., Koh, J.: Reduction and expansion of live and safe marked graphs. IEEE Trans. Circuits Syst. 27(1) (1980). https:\/\/doi.org\/10.1109\/TCS.1980.1084711","DOI":"10.1109\/TCS.1980.1084711"},{"issue":"4","key":"1_CR31","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"issue":"3","key":"1_CR32","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1145\/356698.356702","volume":"9","author":"JL Peterson","year":"1977","unstructured":"Peterson, J.L.: Petri nets. ACM Comput. Surv. 9(3), 223\u2013252 (1977)","journal-title":"ACM Comput. Surv."},{"key":"1_CR33","unstructured":"Semenov, A., Yakovlev, A.: Combining partial orders and symbolic traversal for efficient verification of asynchronous circuits. In: Ohtsuki, T., Johnson, S. (eds.) Proceedings of the 12th International Conference on Computer Hardware Description Languages and their Applications (CHDL\u201995), Makuhari, Chiba, Japan. IEEE, August\u2013September 1995"},{"key":"1_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/3-540-65306-6_19","volume-title":"Lectures on Petri Nets I: Basic Models","author":"M Silva","year":"1998","unstructured":"Silva, M., Terue, E., Colom, J.M.: Linear algebraic and linear programming techniques for the analysis of place\/transition net systems. In: Reisig, W., Rozenberg, G. (eds.) ACPN 1996. LNCS, vol. 1491, pp. 309\u2013373. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/3-540-65306-6_19"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Wi\u015bniewski, R., Karatkevich, A., Adamski, M., Kur, D.: Application of comparability graphs in decomposition of Petri nets. In: Proceedings of the 7th International Conference on Human System Interactions (HSI\u201914), Costa da Caparica, Portugal, pp. 216\u2013220. IEEE, June 2014","DOI":"10.1109\/HSI.2014.6860478"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Wi\u015bniewski, R., Wi\u015bniewska, M., Jarnut, M.: C-exact hypergraphs in concurrency and sequentiality analyses of cyber-physical systems specified by safe Petri nets. IEEE Access 7 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2893284","DOI":"10.1109\/ACCESS.2019.2893284"}],"container-title":["Lecture Notes in Computer Science","Transactions on Petri Nets and Other Models of Concurrency XVII"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-68191-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,31]],"date-time":"2023-10-31T06:02:22Z","timestamp":1698732142000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-68191-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"ISBN":["9783662681909","9783662681916"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-68191-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,1]]},"assertion":[{"value":"1 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}