{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:47:44Z","timestamp":1725727664611},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385919"},{"type":"electronic","value":"9783642385926"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38592-6_14","type":"book-chapter","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T00:56:11Z","timestamp":1369788971000},"page":"193-208","source":"Crossref","is-referenced-by-count":9,"title":["Verification of Directed Acyclic Ad Hoc Networks"],"prefix":"10.1007","author":[{"given":"Parosh Aziz","family":"Abdulla","sequence":"first","affiliation":[]},{"given":"Mohamed Faouzi","family":"Atig","sequence":"additional","affiliation":[]},{"given":"Othmane","family":"Rezine","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","unstructured":"Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: General decidability theorems for infinite-state systems. In: LICS 1996, pp. 313\u2013321. IEEE Computer Society (1996)"},{"key":"14_CR2","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":"14_CR3","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":"14_CR4","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":"7","key":"14_CR5","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. London Math. Soc. (3)\u00a02(7), 326\u2013336 (1952)","journal-title":"Proc. London Math. Soc (3)"},{"issue":"1","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TNET.2002.808417","volume":"11","author":"C. Intanagonwiwat","year":"2003","unstructured":"Intanagonwiwat, C., Govindan, R., Estrin, D., Heidemann, J., Silva, F.: Directed diffusion for wireless sensor networking. IEEE\/ACM Trans. Netw.\u00a011(1), 2\u201316 (2003)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR7","unstructured":"Levis, P., Patel, N., Culler, D.E., Shenker, S.: Trickle: A self-regulating algorithm for code propagation and maintenance in wireless sensor networks. In: NSDI, pp. 15\u201328 (2004)"},{"issue":"47","key":"14_CR8","doi-asserted-by":"publisher","first-page":"6585","DOI":"10.1016\/j.tcs.2011.07.016","volume":"412","author":"M. Merro","year":"2011","unstructured":"Merro, M., Ballardin, F., Sibilio, E.: A timed calculus for wireless systems. Theor. Comput. Sci.\u00a0412(47), 6585\u20136611 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1-2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/j.tcs.2006.08.036","volume":"367","author":"S. Nanz","year":"2006","unstructured":"Nanz, S., Hankin, C.: A framework for security analysis of mobile wireless networks. Theor. Comput. Sci.\u00a0367(1-2), 203\u2013227 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"2-3","key":"14_CR10","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. Comput. Program.\u00a025(2-3), 285\u2013327 (1995)","journal-title":"Sci. Comput. Program."},{"key":"14_CR11","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":"14_CR12","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":"14_CR13","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."}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38592-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T08:03:16Z","timestamp":1557734596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38592-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385919","9783642385926"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38592-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}