{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T18:10:01Z","timestamp":1746295801788,"version":"3.40.4"},"publisher-location":"Cham","reference-count":57,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091075"},{"type":"electronic","value":"9783319091082"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09108-2_1","type":"book-chapter","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T13:07:01Z","timestamp":1404479221000},"page":"1-16","source":"Crossref","is-referenced-by-count":1,"title":["Parameterized Verification and Model Checking for Distributed Broadcast Protocols"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Abdulla, P., Delzanno, G.: Constrained multiset rewriting. In: AVIS 2006 (2006)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Atig, M.F., Rezine, O.: Verification of directed acyclic ad hoc networks. In: Beyer, D., Boreale, M. (eds.) FMOODS\/FORTE 2013. LNCS, vol.\u00a07892, pp. 193\u2013208. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38592-6_14"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.-K.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society (1996)","DOI":"10.1109\/LICS.1996.561359"},{"issue":"3","key":"1_CR4","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.ic.2010.11.003","volume":"209","author":"P.A. Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Van Begin, L.: A classification of the expressive power of well-structured transition systems. Inf. Comput.\u00a0209(3), 248\u2013279 (2011)","journal-title":"Inf. Comput."},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, A.: Automatic verification of directory-based consistency protocols with graph constraints. Int. J. Found. Comput. Sci.\u00a022(4) (2011)","DOI":"10.1142\/S0129054111008416"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s10703-008-0062-9","volume":"34","author":"P.A. Abdulla","year":"2009","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, A.: Approximated parameterized verification of infinite-state processes with global conditions. Formal Methods in System Design\u00a034(2), 126\u2013156 (2009)","journal-title":"Formal Methods in System Design"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/978-3-642-24310-3_18","volume-title":"Formal Modeling and Analysis of Timed Systems","author":"P.A. Abdulla","year":"2011","unstructured":"Abdulla, P.A., Delzanno, G., Rezine, O., Sangnier, A., Traverso, R.: On the verification of timed ad hoc networks. In: Fahrenberg, U., Tripakis, S. (eds.) FORMATS 2011. LNCS, vol.\u00a06919, pp. 256\u2013270. Springer, Heidelberg (2011)"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/978-3-540-78163-9_7","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"P.A. Abdulla","year":"2008","unstructured":"Abdulla, P.A., Ben Henda, N., Delzanno, G., Rezine, A.: Handling parameterized systems with non-atomic global conditions. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol.\u00a04905, pp. 22\u201336. Springer, Heidelberg (2008)"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1006\/inco.1996.0083","volume":"130","author":"P.A. Abdulla","year":"1996","unstructured":"Abdulla, P.A., Jonsson, B.: Undecidable verification problems for programs with unreliable channels. Inf. Comput.\u00a0130(1), 71\u201390 (1996)","journal-title":"Inf. Comput."},{"issue":"1-2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0304-3975(00)00105-5","volume":"256","author":"P.A. Abdulla","year":"2001","unstructured":"Abdulla, P.A., Jonsson, B.: Ensuring completeness of symbolic verification methods for infinite-state systems. Theor. Comput. Sci.\u00a0256(1-2), 145\u2013167 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Nyl\u00e9n, A.: Better is better than well: On efficient verification of infinite-state systems. In: LICS 2000, pp. 132\u2013140. IEEE Computer Society (2000)","DOI":"10.1109\/LICS.2000.855762"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Alberti, F., Ghilardi, S., Pagani, E., Ranise, S., Rossi, G.P.: Automated support for the design and validation of fault tolerant parameterized systems: A case study. ECEASST\u00a035 (2010)","DOI":"10.1007\/978-3-642-15763-9_36"},{"key":"1_CR13","unstructured":"Bertrand, N., Delzanno, G., K\u00f6nig, B., Sangnier, A., St\u00fcckrath, J.: On the decidability status of reachability and coverability in graph transformation systems. In: RTA, pp. 101\u2013116 (2012)"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-54830-7_9","volume-title":"Foundations of Software Science and Computation Structures","author":"N. Bertrand","year":"2014","unstructured":"Bertrand, N., Fournier, P., Sangnier, A.: Playing with probabilities in reconfigurable broadcast networks. In: Muscholl, A. (ed.) FOSSACS 2014 (ETAPS). LNCS, vol.\u00a08412, pp. 134\u2013148. Springer, Heidelberg (2014)"},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-642-13464-7_17","volume-title":"Formal Techniques for Distributed Systems","author":"P. Bokor","year":"2010","unstructured":"Bokor, P., Serafini, M., Suri, N.: On efficient models for model checking message-passing distributed protocols. In: Hatcliff, J., Zucca, E. (eds.) FMOODS 2010, Part II. LNCS, vol.\u00a06117, pp. 216\u2013223. Springer, Heidelberg (2010)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V. Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal molecular biology. Theor. Comput. Sci.\u00a0325(1), 69\u2013110 (2004)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S1571-0661(04)80786-2","volume":"76","author":"G. Delzanno","year":"2002","unstructured":"Delzanno, G.: An overview of msr(c): A clp-based framework for the symbolic verification of parameterized concurrent systems. Electr. Notes Theor. Comput. Sci.\u00a076, 65\u201382 (2002)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"issue":"3","key":"1_CR18","first-page":"257","volume":"23","author":"G. Delzanno","year":"2003","unstructured":"Delzanno, G.: Constraint-based verification of parameterized cache coherence protocols. FMSD\u00a023(3), 257\u2013301 (2003)","journal-title":"FMSD"},{"issue":"1-2","key":"1_CR19","first-page":"67","volume":"7","author":"G. Delzanno","year":"2007","unstructured":"Delzanno, G.: Constraint-based automatic verification of abstract models of multithreaded programs. TPLP\u00a07(1-2), 67\u201391 (2007)","journal-title":"TPLP"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/3-540-48168-0_5","volume-title":"Computer Science Logic","author":"G. Delzanno","year":"1999","unstructured":"Delzanno, G., Esparza, J., Podelski, A.: Constraint-based analysis of broadcast protocols. In: Flum, J., Rodr\u00edguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol.\u00a01683, pp. 50\u201366. Springer, Heidelberg (1999)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-03845-7_11","volume-title":"Computational Methods in Systems Biology","author":"G. Delzanno","year":"2009","unstructured":"Delzanno, G., Di Giusto, C., Gabbrielli, M., Laneve, C., Zavattaro, G.: The \u03ba-lattice: Decidability boundaries for qualitative analysis in biological languages. In: Degano, P., Gorrieri, R. (eds.) CMSB 2009. LNCS, vol.\u00a05688, pp. 158\u2013172. Springer, Heidelberg (2009)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Delzanno, G., Rensink, A., Traverso, R.: Graph- versus vector-based analysis of a consensus protocol. In: GRAPHITE (2014)","DOI":"10.4204\/EPTCS.159.5"},{"issue":"2","key":"1_CR23","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10009-011-0213-y","volume":"14","author":"G. Delzanno","year":"2012","unstructured":"Delzanno, G., Rezine, A.: A lightweight regular model checking approach for parameterized systems. STTT\u00a014(2), 207\u2013222 (2012)","journal-title":"STTT"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.09.021","volume":"467","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Rosa-Velardo, F.: On the coverability and reachability languages of monotonic extensions of petri nets. Theor. Comput. Sci.\u00a0467, 12\u201329 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-41036-9_11","volume-title":"Reachability Problems","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Sangnier, A., Traverso, R.: Parameterized verification of broadcast networks of register automata. In: Abdulla, P.A., Potapov, I. (eds.) RP 2013. LNCS, vol.\u00a08169, pp. 109\u2013121. Springer, Heidelberg (2013)"},{"key":"1_CR26","unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS 2012. LIPIcs, vol.\u00a018, pp. 289\u2013300. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)"},{"key":"1_CR27","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":"1_CR28","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.\u00a06604, pp. 441\u2013455. Springer, Heidelberg (2011)"},{"key":"1_CR29","doi-asserted-by":"crossref","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.\u00a07273, pp. 235\u2013250. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-30793-5_15"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-37064-9_22","volume-title":"Language and Automata Theory and Applications","author":"G. Delzanno","year":"2013","unstructured":"Delzanno, G., Traverso, R.: Decidability and complexity results for verification of asynchronous broadcast networks. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 238\u2013249. Springer, Heidelberg (2013)"},{"issue":"5","key":"1_CR31","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":"1_CR32","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. IEEE Computer Society (1998)","DOI":"10.1109\/LICS.1998.705644"},{"key":"1_CR33","unstructured":"Ene, C., Muntean, T.: A broadcast-based calculus for communicating systems. In: IPDPS 2001, p. 149. IEEE Computer Society (2001)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Esparza, J., Finkel, A., Mayr, R.: On the verification of broadcast protocols. In: LICS 1999, pp. 352\u2013359. IEEE Computer Society (1999)","DOI":"10.1109\/LICS.1999.782630"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-28756-5_13","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Fehnker","year":"2012","unstructured":"Fehnker, A., van Glabbeek, R., H\u00f6fner, P., McIver, A., Portmann, M., Tan, W.L.: Automated analysis of AODV using UPPAAL. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol.\u00a07214, pp. 173\u2013187. Springer, Heidelberg (2012)"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Fehnker, A., van Glabbeek, R., H\u00f6fner, P., McIver, A., Portmann, M., Tan, W.L.: A process algebra for wireless mesh networks. In: Seidl, H. (ed.) ESOP. LNCS, vol.\u00a07211, pp. 295\u2013315. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-28869-2_15"},{"key":"1_CR37","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":"1_CR38","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.\u00a0256(1-2), 63\u201392 (2001)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"1_CR39","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"M.J. Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM\u00a032(2), 374\u2013382 (1985)","journal-title":"J. ACM"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-32940-1_34","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"M. F\u00fcgger","year":"2012","unstructured":"F\u00fcgger, M., Widder, J.: Efficient checking of link-reversal-based concurrent systems. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol.\u00a07454, pp. 486\u2013499. Springer, Heidelberg (2012)"},{"issue":"3","key":"1_CR41","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1145\/146637.146681","volume":"39","author":"S.M. German","year":"1992","unstructured":"German, S.M., Sistla, A.P.: Reasoning about systems with many processes. J. ACM\u00a039(3), 675\u2013735 (1992)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR42","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10009-011-0186-x","volume":"14","author":"A.H. Ghamarian","year":"2012","unstructured":"Ghamarian, A.H., de Mol, M., Rensink, A., Zambon, E., Zimakova, M.: Modelling and analysis using groove. STTT\u00a014(1), 15\u201340 (2012)","journal-title":"STTT"},{"key":"1_CR43","unstructured":"Holzmann, G.J.: The SPIN Model Checker - primer and reference manual. Addison-Wesley (2004)"},{"key":"1_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-39176-7_14","volume-title":"Model Checking Software","author":"A. John","year":"2013","unstructured":"John, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Towards modeling and model checking fault-tolerant distributed algorithms. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol.\u00a07976, pp. 209\u2013226. Springer, Heidelberg (2013)"},{"key":"1_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-39176-7_14","volume-title":"Model Checking Software","author":"A. John","year":"2013","unstructured":"John, A., Konnov, I., Schmid, U., Veith, H., Widder, J.: Towards modeling and model checking fault-tolerant distributed algorithms. In: Bartocci, E., Ramakrishnan, C.R. (eds.) SPIN 2013. LNCS, vol.\u00a07976, pp. 209\u2013226. Springer, Heidelberg (2013)"},{"key":"1_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70545-1_21","volume-title":"Computer Aided Verification","author":"S. Joshi","year":"2008","unstructured":"Joshi, S., K\u00f6nig, B.: Applying the graph minor theorem to the verification of graph transformation systems. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 214\u2013226. Springer, Heidelberg (2008)"},{"issue":"2","key":"1_CR47","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(94)90242-9","volume":"134","author":"M. Kaminski","year":"1994","unstructured":"Kaminski, M., Francez, N.: Finite-memory automata. Theor. Comput. Sci.\u00a0134(2), 329\u2013363 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR48","unstructured":"Konnov, I., Veith, H., Widder, J.: Who is afraid of model checking distributed algorithms? In: Unpublished Contribution to: CAV Workshop (EC)2 (2012)"},{"issue":"3","key":"1_CR49","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L. Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Transactions on Computer Systems\u00a016(3), 133\u2013169 (1998)","journal-title":"ACM Transactions on Computer Systems"},{"key":"1_CR50","unstructured":"Marzullo, K., Mei, A., Meling, H.: A simpler proof for paxos and fast paxos. Course Notes (2013)"},{"key":"1_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-642-35873-9_29","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"K.S. Namjoshi","year":"2013","unstructured":"Namjoshi, K.S., Trefler, R.J.: Uncovering symmetries in irregular process networks. In: Giacobazzi, R., Berdine, J., Mastroeni, I. (eds.) VMCAI 2013. LNCS, vol.\u00a07737, pp. 496\u2013514. Springer, Heidelberg (2013)"},{"key":"1_CR52","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.\u00a0TACAS, pp. 18\u201332. Springer, Heidelberg (2008)"},{"key":"1_CR53","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":"1_CR54","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 hoc network protocols. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol.\u00a05710, pp. 603\u2013619. Springer, Heidelberg (2009)"},{"issue":"6","key":"1_CR55","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1016\/j.scico.2009.07.008","volume":"75","author":"A. Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C.R., Smolka, S.A.: A process calculus for mobile ad hoc networks. Sci. Comput. Program.\u00a075(6), 440\u2013469 (2010)","journal-title":"Sci. Comput. Program."},{"key":"1_CR56","unstructured":"Traverso, R.: Formal verification of ad hoc networks. PhD thesis, University of Genova (2014)"},{"key":"1_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-87779-0_32","volume-title":"Distributed Computing","author":"T. Tsuchiya","year":"2008","unstructured":"Tsuchiya, T., Schiper, A.: Using bounded model checking to verify consensus algorithms. In: Taubenfeld, G. (ed.) DISC 2008. LNCS, vol.\u00a05218, pp. 466\u2013480. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09108-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T17:34:20Z","timestamp":1746293660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-09108-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091075","9783319091082"],"references-count":57,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09108-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}