{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:37:57Z","timestamp":1726043877935},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030308056"},{"type":"electronic","value":"9783030308063"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30806-3_9","type":"book-chapter","created":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:08:36Z","timestamp":1567760916000},"page":"107-120","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parameterised Verification of Publish\/Subscribe Networks with Exception Handling"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,6]]},"reference":[{"issue":"5","key":"9_CR1","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10009-016-0424-3","volume":"18","author":"PA Abdulla","year":"2016","unstructured":"Abdulla, P.A., Delzanno, G.: Parameterized verification. STTT 18(5), 469\u2013473 (2016)","journal-title":"STTT"},{"issue":"1\u20132","key":"9_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(00)00105-5","volume":"256","author":"PA Abdulla","year":"2001","unstructured":"Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci. 256(1\u20132), 145\u2013167 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"9_CR3","series-title":"Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"publisher","DOI":"10.2200\/S00658ED1V01Y201508DCT013","volume-title":"Decidability of Parameterized Verification","author":"R Bloem","year":"2015","unstructured":"Bloem, R., et al.: Decidability of Parameterized Verification. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers, San Rafael (2015)"},{"issue":"2","key":"9_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/2951860.2951873","volume":"47","author":"R Bloem","year":"2016","unstructured":"Bloem, R., et al.: Decidability in parameterized verification. SIGACT News 47(2), 53\u201364 (2016)","journal-title":"SIGACT News"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Conchon, S., Delzanno, G., Ferrando, A.: Parameterized verification of topology-sensitive distributed protocols goes declarative. In: NETYS 2018, pp. 209\u2013224 (2018)","DOI":"10.1007\/978-3-030-05529-5_14"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/3-540-45988-X_7","volume-title":"Frontiers of Combining Systems","author":"G Delzanno","year":"2002","unstructured":"Delzanno, G.: Constraint-based model checking for parameterized synchronous systems. In: Armando, A. (ed.) FroCoS 2002. LNCS (LNAI), vol. 2309, pp. 72\u201386. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-45988-X_7"},{"key":"9_CR7","unstructured":"Delzanno, G.: A logic-based approach to verify distributed protocols. In: CILC 2016, pp. 86\u2013101 (2016)"},{"issue":"5","key":"9_CR8","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10009-016-0412-7","volume":"18","author":"G Delzanno","year":"2016","unstructured":"Delzanno, G.: A unified view of parameterized verification of abstract models of broadcast communication. STTT 18(5), 475\u2013493 (2016)","journal-title":"STTT"},{"key":"9_CR9","unstructured":"Delzanno, G.: Formal verification of internet of things protocols. In: FRIDA@FLOC (2018)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-15375-4_22","volume-title":"CONCUR 2010 - Concurrency Theory","author":"G Delzanno","year":"2010","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of ad hoc networks. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol. 6269, pp. 313\u2013327. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-15375-4_22"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-642-19805-2_30","volume-title":"Foundations of Software Science and Computational Structures","author":"G Delzanno","year":"2011","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: On the power of cliques in the parameterized verification of ad hoc networks. In: Hofmann, M. (ed.) FoSSaCS 2011. LNCS, vol. 6604, pp. 441\u2013455. Springer, Heidelberg (2011). \n                    https:\/\/doi.org\/10.1007\/978-3-642-19805-2_30"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-30793-5_15","volume-title":"Formal Techniques for Distributed Systems","author":"G Delzanno","year":"2012","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Verification of ad hoc networks with node and communication failures. In: Giese, H., Rosu, G. (eds.) FMOODS\/FORTE -2012. LNCS, vol. 7273, pp. 235\u2013250. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-30793-5_15"},{"issue":"4","key":"9_CR13","doi-asserted-by":"publisher","first-page":"413","DOI":"10.2307\/2370405","volume":"35","author":"LE Dickson","year":"1913","unstructured":"Dickson, L.E.: Finiteness of the odd perfect and primitive abundant numbers with n distinct prime factors. Am. J. Math. 35(4), 413\u2013422 (1913)","journal-title":"Am. J. Math."},{"issue":"1\u20132","key":"9_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0304-3975(00)00102-X","volume":"256","author":"A Finkel","year":"2001","unstructured":"Finkel, A., Schnoebelen, P.: Well-structured transition systems everywhere!. Theor. Comput. Sci. 256(1\u20132), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ic.2004.01.005","volume":"195","author":"A Finkel","year":"2004","unstructured":"Finkel, A., McKenzie, P., Picaronny, C.: A well-structured framework for analysing petri net extensions. Inf. Comput. 195(1\u20132), 1\u201329 (2004)","journal-title":"Inf. Comput."},{"issue":"7","key":"9_CR16","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1112\/plms\/s3-2.1.326","volume":"2","author":"G Higman","year":"1952","unstructured":"Higman, G.: Ordering by divisibility in abstract algebras. Proc Lond. Math. Soc. 2(7), 326\u2013336 (1952)","journal-title":"Proc Lond. Math. Soc."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.entcs.2003.10.008","volume":"98","author":"M Kret\u00ednsk\u00fd","year":"2004","unstructured":"Kret\u00ednsk\u00fd, M., Reh\u00e1k, V., Strejcek, J.: On extensions of process rewrite systems: rewrite systems with weak finite-state unit. Electr. Notes Theor. Comput. Sci. 98, 75\u201388 (2004)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"9_CR18","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-540-28644-8_23","volume-title":"CONCUR 2004 - Concurrency Theory","author":"Mojm\u00edr K\u0159et\u00ednsk\u00fd","year":"2004","unstructured":"Kret\u00ednsk\u00fd, M., Reh\u00e1k, V., Strejcek, J.: Extended process rewrite systems: expressiveness and reachability. In: CONCUR 2004, pp. 355\u2013370 (2004)"},{"issue":"1\u20132","key":"9_CR19","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1006\/inco.1999.2826","volume":"156","author":"R Mayr","year":"2000","unstructured":"Mayr, R.: Process rewrite systems. Inf. Comput. 156(1\u20132), 264\u2013286 (2000)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30806-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,6]],"date-time":"2019-09-06T09:09:02Z","timestamp":1567760942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30806-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030308056","9783030308063"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30806-3_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brussels","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.uclouvain.be\/rp2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}