{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:53Z","timestamp":1759637573205,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319395180"},{"type":"electronic","value":"9783319395197"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39519-7_10","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T13:18:53Z","timestamp":1464095933000},"page":"157-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A Semantic Theory of the Internet of Things"],"prefix":"10.1007","author":[{"given":"Ruggero","family":"Lanotte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Merro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1007\/BF01191894","volume":"29","author":"S Arun-Kumar","year":"1992","unstructured":"Arun-Kumar, S., Hennessy, M.: An efficiency preorder for processes. Acta Informatica 29, 737\u2013760 (1992)","journal-title":"Acta Informatica"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-319-05119-2_10","volume-title":"Trustworthy Global Computing","author":"P Attar","year":"2014","unstructured":"Attar, P., Castellani, I.: Fine-grained and coarse-grained reactive noninterference. In: Abadi, M., Lluch Lafuente, A. (eds.) TGC 2013. LNCS, vol. 8358, pp. 159\u2013179. Springer, Heidelberg (2014)"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Benetti, D., Merro, M., Vigano, L.: Model checking ad hoc network routing protocols: Aran vs. endairA. In: Fiadeiro, J.L., Gnesi, S., Maggiolo-Schettini, M. (eds.) SEFM 2010. pp. 191\u2013202. IEEE Computer Society (2010)","DOI":"10.1109\/SEFM.2010.24"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10270-013-0375-z","volume":"14","author":"J Borgstr\u00f6m","year":"2015","unstructured":"Borgstr\u00f6m, J., Huang, S., Johansson, M., Raabjerg, P., Victor, B., Pohjola, J., Parrow, J.: Broadcast psi-calculi with an application to wireless protocols. Softw. Syst. Model. 14(1), 201\u2013216 (2015)","journal-title":"Softw. Syst. Model."},{"issue":"4","key":"10_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1109\/32.491649","volume":"22","author":"F Boussinot","year":"1996","unstructured":"Boussinot, F., de Simone, R.: The SL synchronous language. IEEE Trans. Softw. Eng. 22(4), 256\u2013266 (1996)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"10_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0304-3975(99)00231-5","volume":"240","author":"L Cardelli","year":"2000","unstructured":"Cardelli, L., Gordon, A.: Mobile ambients. TCS 240(1), 177\u2013213 (2000)","journal-title":"TCS"},{"key":"10_CR7","unstructured":"Castiglioni, V., Lanotte, R., Merro, M.: A Semantic Theory of the Internet of Things. CoRR abs\/1510.04854 (2015)"},{"issue":"1: 18","key":"10_CR8","first-page":"1","volume":"11","author":"A Cerone","year":"2015","unstructured":"Cerone, A., Hennessy, M., Merro, M.: Modelling mac-layer communications in wireless systems. Logical Methods Comput. Sci. 11(1: 18), 1\u201359 (2015)","journal-title":"Logical Methods Comput. Sci."},{"issue":"2","key":"10_CR9","first-page":"7: 1","volume":"9","author":"R De Nicola","year":"2014","unstructured":"De Nicola, R., Loreti, M., Pugliese, R., Tiezzi, F.: A Formal Approach to Autonomic Systems Programming: The SCEL language. ACM TAAS 9(2), 7: 1\u20137: 29 (2014)","journal-title":"ACM TAAS"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-3-642-28869-2_15","volume-title":"Programming Languages and Systems","author":"A Fehnker","year":"2012","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.) Programming Languages and Systems. LNCS, vol. 7211, pp. 295\u2013315. Springer, Heidelberg (2012)"},{"issue":"28","key":"10_CR11","doi-asserted-by":"publisher","first-page":"3262","DOI":"10.1016\/j.tcs.2011.03.017","volume":"412","author":"F Ghassemi","year":"2011","unstructured":"Ghassemi, F., Fokkink, W., Movaghar, A.: Verification of mobile ad hoc networks: an algebraic approach. TCS 412(28), 3262\u20133282 (2011)","journal-title":"TCS"},{"key":"10_CR12","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":"JC 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. 4467, pp. 132\u2013150. Springer, Heidelberg (2007)"},{"issue":"7","key":"10_CR13","doi-asserted-by":"publisher","first-page":"1645","DOI":"10.1016\/j.future.2013.01.010","volume":"29","author":"J Gubbi","year":"2013","unstructured":"Gubbi, J., Palaniswami, M.: Internet of things (IoT): a vision, architectural elements, and future directions. Future Gener. Comput. Syst. 29(7), 1645\u20131660 (2013)","journal-title":"Future Gener. Comput. Syst."},{"issue":"2","key":"10_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1006\/inco.1995.1041","volume":"117","author":"M Hennessy","year":"1995","unstructured":"Hennessy, M., Regan, T.: A process algebra for timed systems. Inf. Comput. 117(2), 221\u2013239 (1995)","journal-title":"Inf. Comput."},{"issue":"2","key":"10_CR15","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0304-3975(95)00074-7","volume":"151","author":"K Honda","year":"1995","unstructured":"Honda, K., Yoshida, N.: On reduction-based process semantics. TCS 151(2), 437\u2013486 (1995)","journal-title":"TCS"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Lanese, I., Bedogni, L., Di Felice, M.: Internet of things: a process calculus approach. In: Shin, S.Y., Maldonado, J.C. (eds.) SAC 2013, pp. 1339\u20131346. ACM (2013)","DOI":"10.1145\/2480362.2480615"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"1928","DOI":"10.1016\/j.tcs.2010.01.023","volume":"411","author":"I Lanese","year":"2010","unstructured":"Lanese, I., Sangiorgi, D.: An operational semantics for a calculus for wireless systems. TCS 411, 1928\u20131948 (2010)","journal-title":"TCS"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-23217-6_11","volume-title":"CONCUR 2011 \u2013 Concurrency Theory","author":"R Lanotte","year":"2011","unstructured":"Lanotte, R., Merro, M.: Semantic analysis of gossip protocols for wireless sensor networks. In: Katoen, J.-P., K\u00f6nig, B. (eds.) CONCUR 2011. LNCS, vol. 6901, pp. 156\u2013170. Springer, Heidelberg (2011)"},{"issue":"2","key":"10_CR19","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 (full version). Inf. Comput. 207(2), 194\u2013208 (2009)","journal-title":"Inf. Comput."},{"issue":"47","key":"10_CR20","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. TCS 412(47), 6585\u20136611 (2011)","journal-title":"TCS"},{"issue":"5","key":"10_CR21","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1007\/s00165-011-0210-7","volume":"25","author":"M Merro","year":"2013","unstructured":"Merro, M., Sibilio, E.: A calculus of trustworthy ad hoc networks. Formal Aspects Comput. 25(5), 801\u2013832 (2013)","journal-title":"Formal Aspects Comput."},{"key":"10_CR22","unstructured":"Milner, R.: The polyadic $$\\pi $$-calculus: a tutorial. Technical report, LFCS (1991)"},{"issue":"1\u20132","key":"10_CR23","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. TCS 367(1\u20132), 203\u2013227 (2006)","journal-title":"TCS"},{"key":"10_CR24","doi-asserted-by":"crossref","DOI":"10.1017\/9781316134924","volume-title":"The Pi-Calculus a Theory of Mobile Processes","author":"D Sangiorgi","year":"2001","unstructured":"Sangiorgi, D., Walker, D.: The Pi-Calculus a Theory of Mobile Processes. Cambridge University Press, New York (2001)"},{"key":"10_CR25","series-title":"Lecture Notes in Control and Information Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0109998","volume-title":"An Introduction to Hybrid Dynamical Systems","author":"A Schaft","year":"2000","unstructured":"Schaft, A., Schumacher, H.: An Introduction to Hybrid Dynamical Systems. Lecture Notes in Control and Information Science, vol. 251. Springer, Heidelberg (2000)"},{"issue":"6","key":"10_CR26","first-page":"440","volume":"75","author":"A Singh","year":"2010","unstructured":"Singh, A., Ramakrishnan, C., Smolka, S.: A process calculus for Mobile Ad Hoc Networks. SCP 75(6), 440\u2013469 (2010)","journal-title":"SCP"},{"issue":"3","key":"10_CR27","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/j.adhoc.2005.01.002","volume":"3","author":"B Sundararaman","year":"2005","unstructured":"Sundararaman, B., Buy, U., Kshemkalyani, A.D.: Clock synchronization for wireless sensor networks: a survey. Ad Hoc Netw. 3(3), 281\u2013323 (2005)","journal-title":"Ad Hoc Netw."},{"key":"10_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-642-38613-8_28","volume-title":"Integrated Formal Methods","author":"R Vigo","year":"2013","unstructured":"Vigo, R., Nielson, F., Nielson, H.R.: Broadcast, denial-of-service, and secure communication. In: Johnsen, E.B., Petre, L. (eds.) IFM 2013. LNCS, vol. 7940, pp. 412\u2013427. Springer, Heidelberg (2013)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Wu, X., Zhu, H.: A calculus for wireless sensor networks from quality perspective. In: HASE 2015, pp. 223\u2013231. IEEE Computer Society (2015)","DOI":"10.1109\/HASE.2015.40"}],"container-title":["Lecture Notes in Computer Science","Coordination Models and Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39519-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,3]],"date-time":"2025-06-03T19:11:28Z","timestamp":1748977888000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39519-7_10"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319395180","9783319395197"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39519-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"24 May 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}