{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T08:06:11Z","timestamp":1791273971285,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642153747","type":"print"},{"value":"9783642153754","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15375-4_22","type":"book-chapter","created":{"date-parts":[[2010,8,20]],"date-time":"2010-08-20T18:04:18Z","timestamp":1282327458000},"page":"313-327","source":"Crossref","is-referenced-by-count":53,"title":["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":"22_CR1","doi-asserted-by":"crossref","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 (1996)","DOI":"10.1109\/LICS.1996.561359"},{"issue":"1-2","key":"22_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."},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/inco.1996.0053","volume":"127","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Inf. Comput.\u00a0127(2), 91\u2013101 (1996)","journal-title":"Inf. Comput."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Delzanno, G., Sangnier, A., Zavattaro, G.: Parameterized verification of Ad Hoc Networks (Extended version). DISI-TR-10-01 (June 2010), http:\/\/www.disi.unige.it\/index.php?research\/techrep","DOI":"10.1007\/978-3-642-15375-4_22"},{"issue":"5","key":"22_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":"22_CR6","doi-asserted-by":"crossref","unstructured":"Emerson, E.A., Namjoshi, K.S.: On model checking for non-deterministic infinite-state systems. In: LICS 1998, pp. 70\u201380 (1998)","DOI":"10.1109\/LICS.1998.705644"},{"key":"22_CR7","unstructured":"Ene, C., Muntean, T.: A broadcast based calculus for Communicating Systems. In: IPDPS 2001, p. 149 (2001)"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of Broadcast Protocols. In: LICS 1999, pp. 352\u2013359 (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"22_CR9","first-page":"245","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Bulletin of the EATCS\u00a052, 245\u2013262 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"22_CR10","unstructured":"Esparza, J.: Some applications of Petri Nets to the analysis of parameterised systems. Talk at WISP 2003 (2003)"},{"key":"22_CR11","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)"},{"issue":"1-2","key":"22_CR12","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! TCS\u00a0256(1-2), 63\u201392 (2001)","journal-title":"TCS"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-72794-1_8","volume-title":"Coordination Models and Languages","author":"J.C. Godskesen","year":"2007","unstructured":"Godskesen, J.C.: A calculus for Mobile Ad Hoc Networks. In: Murphy, A.L., Vitek, J. (eds.) COORDINATION 2007. LNCS, vol.\u00a04467, pp. 132\u2013150. Springer, Heidelberg (2007)"},{"issue":"2","key":"22_CR14","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.ic.2007.11.010","volume":"207","author":"M. Merro","year":"2009","unstructured":"Merro, M.: An observational theory for Mobile Ad Hoc Networks. Inf. Comput.\u00a0207(2), 194\u2013208 (2009)","journal-title":"Inf. Comput."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, R.: On boundedness in depth in the pi-calculus. In: IFIP TCS 2008, pp. 477\u2013489 (2008)","DOI":"10.1007\/978-0-387-09680-3_32"},{"key":"22_CR16","first-page":"331","volume":"158","author":"N. Mezzetti","year":"2006","unstructured":"Mezzetti, N., Sangiorgi, D.: Towards a calculus for wireless systems. ENTCS\u00a0158, 331\u2013353 (2006)","journal-title":"ENTCS"},{"key":"22_CR17","volume-title":"Communicating and mobile systems: the pi-calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and mobile systems: the pi-calculus. Cambridge Univ. Press, Cambridge (1999)"},{"key":"22_CR18","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)"},{"issue":"2-3","key":"22_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6423(95)00017-8","volume":"25","author":"K.V.S. Prasad","year":"1995","unstructured":"Prasad, K.V.S.: A Calculus of Broadcasting Systems. Sci. of Comp. Prog.\u00a025(2-3), 285\u2013327 (1995)","journal-title":"Sci. of Comp. Prog."},{"key":"22_CR20","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":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-540-68265-3_19","volume-title":"Coordination Models and Languages","author":"A. Singh","year":"2008","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for Mobile Ad Hoc Networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.\u00a05052, pp. 296\u2013314. Springer, Heidelberg (2008)"},{"key":"22_CR22","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","author":"A. Singh","year":"2009","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: Query-Based model checking of Ad Hoc Network Protocols. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 603\u2013661. Springer, Heidelberg (2009)"},{"key":"22_CR23","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","CONCUR 2010 - Concurrency Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15375-4_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,24]],"date-time":"2025-02-24T21:12:20Z","timestamp":1740431540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15375-4_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153747","9783642153754"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15375-4_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}