{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T14:11:12Z","timestamp":1791209472618,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642198045","type":"print"},{"value":"9783642198052","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-19805-2_30","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T09:05:14Z","timestamp":1300093514000},"page":"441-455","source":"Crossref","is-referenced-by-count":28,"title":["On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Sangnier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gianluigi","family":"Zavattaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"30_CR1","first-page":"313","volume-title":"LICS 1996","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., \u010cer\u0101ns, C., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society, Los Alamitos (1996)"},{"issue":"1-2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/inco.1999.2843","volume":"160","author":"P.A. Abdulla","year":"2000","unstructured":"Abdulla, P.A., \u010cer\u0101ns, C., Jonsson, B., Tsay, Y.-K.: Algorithmic analysis of programs with well quasi-ordered domains. Inf. Comput.\u00a0160(1-2), 109\u2013127 (2000)","journal-title":"Inf. Comput."},{"key":"30_CR3","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.\u00a06269, pp. 313\u2013327. Springer, Heidelberg (2010)"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: On the Power of Cliques in the Parameterized Verification of Ad Hoc Networks. Technical Report DISI-TR-11-01, DISI-University of Genova (2011)","DOI":"10.1007\/978-3-642-19805-2_30"},{"issue":"5","key":"30_CR5","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1002\/jgt.3190160509","volume":"16","author":"G. Ding","year":"1992","unstructured":"Ding, G.: Subgraphs and well quasi ordering. J. of Graph Theory\u00a016(5), 489\u2013502 (1992)","journal-title":"J. of Graph Theory"},{"key":"30_CR6","first-page":"70","volume-title":"LICS 1998","author":"E.A. Emerson","year":"1998","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: LICS 1998, pp. 70\u201380. IEEE Computer Society, Los Alamitos (1998)"},{"key":"30_CR7","first-page":"352","volume-title":"LICS 1999","author":"J. Esparza","year":"1999","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352\u2013359. IEEE Computer Society, Los Alamitos (1999)"},{"key":"30_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-73210-5_14","volume-title":"Integrated Formal Methods","author":"A. Fehnker","year":"2007","unstructured":"Fehnker, A., van Hoesel, L., Mader, A.: Modelling and verification of the LMAC protocol for wireless sensor networks. In: Davies, J., Gibbons, J. (eds.) IFM 2007. LNCS, vol.\u00a04591, pp. 253\u2013272. Springer, Heidelberg (2007)"},{"key":"30_CR9","first-page":"31","volume-title":"POMC 2002","author":"Y. Fernandess","year":"2002","unstructured":"Fernandess, Y., Malkhi, D.: K-clustering in wireless ad hoc networks. In: POMC 2002, pp. 31\u201337. ACM, New York (2002)"},{"issue":"1-2","key":"30_CR10","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! Theoret. Comp. Sci.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theoret. Comp. Sci."},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1147\/rd.45.0497","volume":"4","author":"A. Hoffman","year":"1960","unstructured":"Hoffman, A., Singleton, R.: On Moore graphs with diameter 2 and 3. IBM J. Res. Develop.\u00a04, 497\u2013504 (1960)","journal-title":"IBM J. Res. Develop."},{"key":"30_CR12","series-title":"IFIP","first-page":"477","volume-title":"IFIP TCS 2008","author":"R. Meyer","year":"2008","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: Ausiello, G., Karhum\u00e4ki, J., Mauri, G., Ong, L. (eds.) IFIP TCS 2008. IFIP, vol.\u00a0273, pp. 477\u2013489. Springer, Heidelberg (2008)"},{"key":"30_CR13","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"30_CR14","volume-title":"Computation: finite and infinite machines","author":"M. Minsky","year":"1967","unstructured":"Minsky, M.: Computation: finite and infinite machines. Prentice-Hall, Englewood Cliffs (1967)"},{"key":"30_CR15","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. Theoret. Comp. Sci.\u00a06, 223\u2013231 (1978)","journal-title":"Theoret. Comp. Sci."},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-15349-5_11","volume-title":"Reachability Problems","author":"F. Rosa-Velardo","year":"2010","unstructured":"Rosa-Velardo, F.: Depth boundedness in multiset rewriting systems with name binding. In: Ku\u010dera, A., Potapov, I. (eds.) RP 2010. LNCS, vol.\u00a06227, pp. 161\u2013175. Springer, Heidelberg (2010)"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-540-78800-3_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M. Saksena","year":"2008","unstructured":"Saksena, M., Wibling, O., Jonsson, B.: Graph Grammar Modeling and Verification of Ad Hoc Routing Protocols. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol.\u00a04963, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"30_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"616","DOI":"10.1007\/978-3-642-15155-2_54","volume-title":"Mathematical Foundations of Computer Science 2010","author":"P. Schnoebelen","year":"2010","unstructured":"Schnoebelen, P.: Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 616\u2013628. Springer, Heidelberg (2010)"},{"key":"30_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1007\/978-3-642-04081-8_40","volume-title":"CONCUR 2009 - Concurrency Theory","author":"A. Singh","year":"2009","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: Query-Based Model Checking of Ad\u00a0Hoc\u00a0Network\u00a0Protocols. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 603\u2013619. Springer, Heidelberg (2009)"},{"key":"30_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-12032-9_8","volume-title":"Foundations of Software Science and Computational Structures","author":"T. Wies","year":"2010","unstructured":"Wies, T., Zufferey, D., Henzinger, T.A.: Forward analysis of depth-bounded processes. In: Ong, L. (ed.) FOSSACS 2010. LNCS, vol.\u00a06014, pp. 94\u2013108. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computational Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19805-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T07:08:41Z","timestamp":1558422521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19805-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642198045","9783642198052"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19805-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}