{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:29:45Z","timestamp":1743013785256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":54,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_13","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"187-205","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Petri Net Invariant Synthesis"],"prefix":"10.1007","author":[{"given":"Peter","family":"Chini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florian","family":"Furbach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/B:FORM.0000004786.30007.f8","volume":"24","author":"PA Abdulla","year":"2004","unstructured":"Abdulla, P.A., Iyer, S.P., Nyl\u00e9n, A.: Sat-solving the coverability problem for Petri nets. Formal Methods Syst. Des. 24(1), 25\u201343 (2004)","journal-title":"Formal Methods Syst. Des."},{"key":"13_CR2","unstructured":"Bach, E., Shallit, J.: Algorithmic Number Theory, Volume I: Efficient Algorithms. MIT Press (1996)"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/978-3-540-69738-1_27","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D Beyer","year":"2007","unstructured":"Beyer, D., Henzinger, T.A., Majumdar, R., Rybalchenko, A.: Invariant synthesis for combined theories. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 378\u2013394. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-69738-1_27"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet, B., et al.: A static analyzer for large safety-critical software. In: PLDI, pp. 196\u2013207. ACM (2003)","DOI":"10.1145\/780822.781153"},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"299","DOI":"10.2307\/2371684","volume":"64","author":"A Brauer","year":"1942","unstructured":"Brauer, A.: On a problem of partitions. Am. J. Math. 64(1), 299\u2013312 (1942)","journal-title":"Am. J. Math."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cardoza, E., Lipton, R., Meyer, A.R.: Exponential space complete problems for Petri nets and commutative semigroups (preliminary report). In: STOC, pp. 50\u201354. ACM (1976)","DOI":"10.1145\/800113.803630"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Chini, P., Furbach, F.: Petri net invariant synthesis. CoRR 2105.03096 (2021)","DOI":"10.1007\/978-3-030-91014-3_13"},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10575-8","volume-title":"Handbook of Model Checking","author":"EM Clarke","year":"2018","unstructured":"Clarke, E.M., Henzinger, T.A., Veith, H., Bloem, R.: Handbook of Model Checking. Springer, Heidelberg (2018)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: POPL, pp. 84\u201396. ACM (1978)","DOI":"10.1145\/512760.512770"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Czerwinski, W., Lasota, S., Lazic, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. In: STOC, pp. 24\u201333. ACM (2019)","DOI":"10.1145\/3313276.3316369"},{"key":"13_CR12","unstructured":"Czerwi\u0144ski, W., Orlikowski, L.: Reachability in vector addition systems is Ackermann-complete. CoRR, 2104.13866 (2021)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/3-540-46002-0_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Delzanno","year":"2002","unstructured":"Delzanno, G., Raskin, J.-F., Van Begin, L.: Towards the automated verification of multithreaded Java programs. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol. 2280, pp. 173\u2013187. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46002-0_13"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-319-08867-9_40","volume-title":"Computer Aided Verification","author":"J Esparza","year":"2014","unstructured":"Esparza, J., Ledesma-Garza, R., Majumdar, R., Meyer, P., Niksic, F.: An SMT-based approach to coverability analysis. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 603\u2013619. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_40"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-48320-9_2","volume-title":"CONCUR\u201999 Concurrency Theory","author":"J Esparza","year":"1999","unstructured":"Esparza, J., R\u00f6mer, S.: An unfolding algorithm for synchronous products of transition systems. In: Baeten, J.C.M., Mauw, S. (eds.) CONCUR 1999. LNCS, vol. 1664, pp. 2\u201320. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48320-9_2"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-61042-1_40","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J Esparza","year":"1996","unstructured":"Esparza, J., R\u00f6mer, S., Vogler, W.: An improvement of McMillan\u2019s unfolding algorithm. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 87\u2013106. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61042-1_40"},{"key":"13_CR17","unstructured":"Furbach, F.: Inequalizer - a prototype tool for linear safety verification of Petri nets. https:\/\/github.com\/florianfurbach\/Inequalizer"},{"key":"13_CR18","doi-asserted-by":"crossref","unstructured":"Floyd, R.W.: Assigning meanings to programs. In: Proceedings of a Symposium on Applied Mathematics, vol. 19, pp. 19\u201332 (1967)","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"13_CR19","unstructured":"Ganty, P., Meuter, C., Van Begin, L., Kalyon, G., Raskin, J., Delzanno, G.: Symbolic data structure for sets of k-tuples of integers. Technical report (2007)"},{"key":"13_CR20","first-page":"124","volume":"88","author":"P Ganty","year":"2007","unstructured":"Ganty, P., Raskin, J., Van Begin, L.: From many places to few: automatic abstraction refinement for Petri nets. Fundam. Inform. 88, 124\u2013143 (2007)","journal-title":"Fundam. Inform."},{"issue":"3","key":"13_CR21","first-page":"275","volume":"88","author":"P Ganty","year":"2008","unstructured":"Ganty, P., Raskin, J.-F., Van Begin, L.: From many places to few: automatic abstraction refinement for Petri nets. Fundam. Inform. 88(3), 275\u2013305 (2008)","journal-title":"Fundam. Inform."},{"key":"13_CR22","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co. (1990)"},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/j.jcss.2005.09.001","volume":"72","author":"G Geeraerts","year":"2006","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: Expand, enlarge and check: new algorithms for the coverability problem of WSTS. J. Comput. Syst. Sci. 72, 180\u2013203 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-540-75596-8_9","volume-title":"Automated Technology for Verification and Analysis","author":"G Geeraerts","year":"2007","unstructured":"Geeraerts, G., Raskin, J.-F., Van Begin, L.: On the efficient computation of the minimal coverability set for Petri nets. In: Namjoshi, K.S., Yoneda, T., Higashino, T., Okamura, Y. (eds.) ATVA 2007. LNCS, vol. 4762, pp. 98\u2013113. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75596-8_9"},{"key":"13_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04963-1","volume-title":"A Singular Introduction to Commutative Algebra","author":"G-M Greuel","year":"2002","unstructured":"Greuel, G.-M., Pfister, G.: A Singular Introduction to Commutative Algebra. Springer, Heidelberg (2002)"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Gulwani, S., Srivastava, S., Venkatesan, R.: Program analysis as constraint solving. In: PLDI, pp. 281\u2013292. ACM (2008)","DOI":"10.1145\/1379022.1375616"},{"key":"13_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-642-00768-2_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Gupta","year":"2009","unstructured":"Gupta, A., Majumdar, R., Rybalchenko, A.: From tests to proofs. In: Kowalewski, S., Philippou, A. (eds.) TACAS 2009. LNCS, vol. 5505, pp. 262\u2013276. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00768-2_24"},{"key":"13_CR28","doi-asserted-by":"crossref","unstructured":"Hartmanis, J.: Context-free languages and turing machine computations. In: Symposia in Applied Mathematics, vol. 19, pp. 42\u201351 (1967)","DOI":"10.1090\/psapm\/019\/0235938"},{"issue":"10","key":"13_CR29","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"CAR Hoare","year":"1969","unstructured":"Hoare, C.A.R.: An axiomatic basis for computer programming. Commun. ACM 12(10), 576\u2013580 (1969)","journal-title":"Commun. ACM"},{"key":"13_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-32940-1_35","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"A Kaiser","year":"2012","unstructured":"Kaiser, A., Kroening, D., Wahl, T.: Efficient coverability analysis by proof minimization. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 500\u2013515. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32940-1_35"},{"issue":"2","key":"13_CR31","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp, R.M., Miller, R.E.: Parallel program schemata. J. Comput. Syst. Sci. 3(2), 147\u2013195 (1969)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-39799-8_10","volume-title":"Computer Aided Verification","author":"J Kloos","year":"2013","unstructured":"Kloos, J., Majumdar, R., Niksic, F., Piskac, R.: Incremental, inductive coverability. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 158\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_10"},{"key":"13_CR33","doi-asserted-by":"crossref","unstructured":"Rao Kosaraju, S.: Decidability of reachability in vector addition systems. In: STOC, pp. 267\u2013281. ACM (1982)","DOI":"10.1145\/800070.802201"},{"issue":"1","key":"13_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0304-3975(92)90173-D","volume":"99","author":"J Lambert","year":"1992","unstructured":"Lambert, J.: A structure to decide reachability in Petri nets. Theor. Comput. Sci. 99(1), 79\u2013104 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/3-540-48683-6_18","volume-title":"Computer Aided Verification","author":"R Langerak","year":"1999","unstructured":"Langerak, R., Brinksma, E.: A complete finite prefix for process algebra. In: Halbwachs, N., Peled, D. (eds.) CAV 1999. LNCS, vol. 1633, pp. 184\u2013195. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48683-6_18"},{"key":"13_CR36","unstructured":"Leroux, J.: The reachability problem for Petri nets is not primitive recursive. CoRR, 2104.12695 (2021)"},{"key":"13_CR37","doi-asserted-by":"crossref","unstructured":"Leroux, J., Schmitz, S.: Reachability in vector addition systems is primitive-recursive in fixed dimension. In: LICS, pp. 1\u201313. IEEE (2019)","DOI":"10.1109\/LICS.2019.8785796"},{"key":"13_CR38","unstructured":"Lipton, R.J.: The reachability problem requires exponential space. Research report (Yale University. Department of Computer Science). Department of Computer Science, Yale University (1976)"},{"key":"13_CR39","doi-asserted-by":"crossref","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. In: STOC, pp. 238\u2013246. ACM (1981)","DOI":"10.1145\/800076.802477"},{"issue":"3","key":"13_CR40","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1137\/0213029","volume":"13","author":"E Mayr","year":"1984","unstructured":"Mayr, E.: An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13(3), 441\u2013460 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"13_CR41","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01384314","volume":"6","author":"KL McMillan","year":"1995","unstructured":"McMillan, K.L.: A technique of state space search based on unfolding. Form. Methods Syst. Des. 6(1), 45\u201365 (1995)","journal-title":"Form. Methods Syst. Des."},{"key":"13_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"issue":"4","key":"13_CR43","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata, T.: Petri nets: properties, analysis and applications. Proc. IEEE 77(4), 541\u2013580 (1989)","journal-title":"Proc. IEEE"},{"key":"13_CR44","unstructured":"Ganty, P.: MIST - a safety checker for Petri nets and extensions. https:\/\/github.com\/pierreganty\/mist"},{"key":"13_CR45","volume-title":"Petri Net Theory and the Modeling of Systems","author":"JL Peterson","year":"1981","unstructured":"Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall, Hoboken (1981)"},{"key":"13_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24622-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Podelski","year":"2004","unstructured":"Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239\u2013251. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24622-0_20"},{"issue":"2","key":"13_CR47","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(78)90036-1","volume":"6","author":"C Rackoff","year":"1978","unstructured":"Rackoff, C.: The covering and boundedness problems for vector addition systems. Theor. Comput. Sci. 6(2), 223\u2013231 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/978-3-642-21834-7_5","volume-title":"Applications and Theory of Petri Nets","author":"P-A Reynier","year":"2011","unstructured":"Reynier, P.-A., Servais, F.: Minimal coverability set for Petri nets: Karp and miller algorithm with pruning. In: Kristensen, L.M., Petrucci, L. (eds.) PETRI NETS 2011. LNCS, vol. 6709, pp. 69\u201388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21834-7_5"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-540-39910-0_29","volume-title":"Verification: Theory and Practice","author":"S Sankaranarayanan","year":"2003","unstructured":"Sankaranarayanan, S., Sipma, H., Manna, Z.: Petri net analysis using invariant generation. In: Dershowitz, N. (ed.) Verification: Theory and Practice. LNCS, vol. 2772, pp. 682\u2013701. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39910-0_29"},{"key":"13_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-30579-8_2","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S Sankaranarayanan","year":"2005","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Scalable analysis of linear systems using mathematical programming. In: Cousot, R. (ed.) VMCAI 2005. LNCS, vol. 3385, pp. 25\u201341. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30579-8_2"},{"key":"13_CR51","unstructured":"Sipser, M.: Introduction to the Theory of Computation. PWS Publishing Company (1997)"},{"key":"13_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-319-19488-2_14","volume-title":"Application and Theory of Petri Nets and Concurrency","author":"M Triebel","year":"2015","unstructured":"Triebel, M., S\u00fcrmeli, J.: Characterizing stable inequalities of Petri nets. In: Devillers, R., Valmari, A. (eds.) PETRI NETS 2015. LNCS, vol. 9115, pp. 266\u2013286. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19488-2_14"},{"key":"13_CR53","doi-asserted-by":"crossref","unstructured":"Turing, A.M.: On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. s2\u201342(1), 230\u2013265 (1937)","DOI":"10.1112\/plms\/s2-42.1.230"},{"key":"13_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-31131-4_12","volume-title":"Application and Theory of Petri Nets","author":"A Valmari","year":"2012","unstructured":"Valmari, A., Hansen, H.: Old and new algorithms for minimal coverability sets. In: Haddad, S., Pomello, L. (eds.) PETRI NETS 2012. LNCS, vol. 7347, pp. 208\u2013227. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31131-4_12"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T21:01:39Z","timestamp":1673902899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,84","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}