{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:45:22Z","timestamp":1725727522763},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642391750"},{"type":"electronic","value":"9783642391767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39176-7_11","type":"book-chapter","created":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T04:58:44Z","timestamp":1369889924000},"page":"160-177","source":"Crossref","is-referenced-by-count":5,"title":["Specification and Validation of Link Reversal Routing via Graph Transformations"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Delzanno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Traverso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/11787006_45","volume-title":"Automata, Languages and Programming","author":"I. Balaban","year":"2006","unstructured":"Balaban, I., Pnueli, A., Zuck, L.D.: Invisible safety of distributed protocols. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, Part II. LNCS, vol.\u00a04052, pp. 528\u2013539. Springer, Heidelberg (2006)"},{"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":"11_CR2"},{"issue":"4","key":"11_CR3","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1145\/581771.581775","volume":"49","author":"K. Bhargavan","year":"2002","unstructured":"Bhargavan, K., Obradovic, D., Gunter, C.A.: Formal verification of standards for distance vector routing protocols. J. ACM\u00a049(4), 538\u2013576 (2002)","journal-title":"J. ACM"},{"unstructured":"Delzanno, G., Sangnier, A., Traverso, R., Zavattaro, G.: On the complexity of parameterized reachability in reconfigurable broadcast networks. In: FSTTCS, pp. 289\u2013300 (2012)","key":"11_CR4"},{"key":"11_CR5","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":"11_CR6","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)"},{"doi-asserted-by":"crossref","unstructured":"Ehrig, H., Rozenberg, G.: Handbook of Graph Grammars and Computing by Graph Transformations, vol.\u00a01-3. World Scientific Publishing (1997)","key":"11_CR7","DOI":"10.1142\/9789812384720"},{"key":"11_CR8","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":"11_CR9","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":"11_CR10","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)"},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1109\/TCOM.1981.1094876","volume":"29","author":"E. Gafni","year":"1981","unstructured":"Gafni, E., Bertsekas, D.: Distributed algorithms for generating loop-free routes in networks with frequently changing topology. IEEE Transactions on Communications\u00a029, 11\u201318 (1981)","journal-title":"IEEE Transactions on Communications"},{"issue":"1","key":"11_CR12","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"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.entcs.2005.12.018","volume":"148","author":"R. Heckel","year":"2006","unstructured":"Heckel, R.: Graph transformation in a nutshell. Electronic Notes in Theoretical Computer Science\u00a0148(1), 187\u2013198 (2006)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"11_CR14","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)"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/11691617_19","volume-title":"Model Checking Software","author":"H. Kastenberg","year":"2006","unstructured":"Kastenberg, H., Rensink, A.: Model checking dynamic states in GROOVE. In: Valmari, A. (ed.) SPIN 2006. LNCS, vol.\u00a03925, pp. 299\u2013305. Springer, Heidelberg (2006)"},{"unstructured":"K\u00f6nig, B.: Analysis and verification of systems with dynamically evolving structure. PhD thesis, Universit\u00e4t Stuttgart (2004)","key":"11_CR16"},{"unstructured":"Konnov, I., Veith, H., Widder, J.: Who is afraid of model checking distributed algorithms? Unpublished contribution to: CAV Workshop (EC)2 (2012)","key":"11_CR17"},{"key":"11_CR18","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":"11_CR19","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\u00a0ad\u00a0hoc\u00a0networks. In: Lea, D., Zavattaro, G. (eds.) COORDINATION 2008. LNCS, vol.\u00a05052, pp. 296\u2013314. Springer, Heidelberg (2008)"},{"key":"11_CR20","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)"},{"issue":"6","key":"11_CR21","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."},{"doi-asserted-by":"crossref","unstructured":"Welch, J.L., Walter, J.E.: Link Reversal Algorithms. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2011)","key":"11_CR22","DOI":"10.2200\/S00389ED1V01Y201111DCT008"}],"container-title":["Lecture Notes in Computer Science","Model Checking Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39176-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:52:45Z","timestamp":1557737565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39176-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642391750","9783642391767"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39176-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}