{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:35:54Z","timestamp":1743089754209,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031745799"},{"type":"electronic","value":"9783031745805"}],"license":[{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,27]],"date-time":"2024-12-27T00:00:00Z","timestamp":1735257600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-74580-5_13","type":"book-chapter","created":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T15:35:59Z","timestamp":1735227359000},"page":"173-187","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Modular Population Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6660-5673","authenticated-orcid":false,"given":"Michael","family":"Raskin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,12,27]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Chan, M., Fischer, M.J., Jiang, H., Peralta, R.: Stably computable properties of network graphs. In: International Conference on Distributed Computing in Sensor Systems (2005). https:\/\/api.semanticscholar.org\/CorpusID:16310485","DOI":"10.1007\/11502593_8"},{"key":"13_CR2","doi-asserted-by":"publisher","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. In: Chaudhuri, S., Kutten, S. (eds.) PODC, pp. 290\u2013299. ACM (2004). https:\/\/doi.org\/10.1145\/1011767.1011810","DOI":"10.1145\/1011767.1011810"},{"issue":"4","key":"13_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00446-005-0138-3","volume":"18","author":"D Angluin","year":"2006","unstructured":"Angluin, D., Aspnes, J., Diamadi, Z., Fischer, M.J., Peralta, R.: Computation in networks of passively mobile finite-state sensors. Distrib. Comput. 18(4), 235\u2013253 (2006)","journal-title":"Distrib. Comput."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: Fast computation by population protocols with a leader. In: Dolev, S. (ed.) In Distributed Computing: 20th International Symposium, DISC 2006. Lecture Notes in Computer Science, vol.\u00a04167, pp. 61\u201375. Springer (2006)","DOI":"10.1007\/11864219_5"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007). https:\/\/arxiv.org\/abs\/cs\/0608084","DOI":"10.1007\/s00446-007-0040-2"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: TAAS (2005). https:\/\/api.semanticscholar.org\/CorpusID:63153","DOI":"10.1007\/11795490_10"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Austin, M.A., Johnson, J.: Compositional approach to distributed system behavior modeling and formal validation of infrastructure operations with finite state automata: application to viewpoint-driven verification of functionality in waterways. Syst. 6, 2 (2018). https:\/\/api.semanticscholar.org\/CorpusID:4786185","DOI":"10.3390\/systems6010002"},{"key":"13_CR8","unstructured":"Blondin, M., Esparza, J., Genest, B., Helfrich, M., Jaax, S.: Succinct population protocols for Presburger arithmetic. In submission (2019). http:\/\/arxiv.org\/abs\/1910.04600"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Blondin, M., Esparza, J., Jaax, S., Meyer, P.J.: Towards efficient verification of population protocols. In: Schiller, E.M., Schwarzmann, A.A. (eds.) PODC, pp. 423\u2013430. ACM (2017)","DOI":"10.1145\/3087801.3087816"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Czerner, P., Guttenberg, R., Helfrich, M., Esparza, J.: Fast and succinct population protocols for Presburger arithmetic. J. Comput. Syst. Sci. 140, 103481 (2024). https:\/\/doi.org\/10.1016\/j.jcss.2023.103481","DOI":"10.1016\/j.jcss.2023.103481"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Czerwi\u0144ski, W., Lasota, S., Lazi\u0107, R., Leroux, J., Mazowiecki, F.: The reachability problem for Petri nets is not elementary. In: Proc. $$51^{st}$$ Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 24\u201333 (2019). https:\/\/doi.org\/10.1145\/3313276.3316369","DOI":"10.1145\/3313276.3316369"},{"key":"13_CR12","unstructured":"Delporte-Gallet, C., Devismes, S., Fauconnier, H.: Robust stabilizing leader election. In: Safety-critical Systems Symposium (2007). https:\/\/api.semanticscholar.org\/CorpusID:2179550"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Dijkstra, E.W.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17, 643\u2013644 (1974). https:\/\/api.semanticscholar.org\/CorpusID:11101426","DOI":"10.1145\/361179.361202"},{"issue":"1","key":"13_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02278851","volume":"7","author":"S Dolev","year":"1993","unstructured":"Dolev, S., Israeli, A., Moran, S.: Self-stabilization of dynamic systems assuming only read\/write atomicity. Distrib. Comput. 7(1), 3\u201316 (1993). https:\/\/doi.org\/10.1007\/BF02278851","journal-title":"Distrib. Comput."},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Doty, D., Soloveichik, D.: Stable leader election in population protocols requires linear time. In: Moses, Y. (ed.) DISC. LNCS, vol.\u00a09363, pp. 602\u2013616. Springer, Cham (2015). https:\/\/arxiv.org\/abs\/1502.04246","DOI":"10.1007\/978-3-662-48653-5_40"},{"key":"13_CR16","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Verification of population protocols. In: Aceto, L., de\u00a0Frutos\u00a0Escrig, D. (eds.) 26th International Conference on Concurrency Theory (CONCUR 2015). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a042, pp. 470\u2013482. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2015). https:\/\/doi.org\/10.4230\/LIPIcs.CONCUR.2015.470, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2015\/5377","DOI":"10.4230\/LIPIcs.CONCUR.2015.470"},{"key":"13_CR17","doi-asserted-by":"publisher","unstructured":"Esparza, J., Ganty, P., Leroux, J., Majumdar, R.: Model checking population protocols. In: Lal, A., Akshay, S., Saurabh, S., Sen, S. (eds.) 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol.\u00a065, pp. 27:1\u201327:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2016.27, http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6862","DOI":"10.4230\/LIPIcs.FSTTCS.2016.27"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s00446-021-00390-x","volume":"34","author":"J Esparza","year":"2021","unstructured":"Esparza, J., Jaax, S., Raskin, M.A., Weil-Kennedy, C.: The complexity of verifying population protocols. Distrib. Comput. 34(2), 133\u2013177 (2021). https:\/\/doi.org\/10.1007\/s00446-021-00390-x","journal-title":"Distrib. Comput."},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Esparza, J., Raskin, M., Weil-Kennedy, C.: Parameterized analysis of immediate observation petri nets (2019). http:\/\/arxiv.org\/abs\/1902.03025","DOI":"10.1007\/978-3-030-21571-2_20"},{"key":"13_CR20","doi-asserted-by":"publisher","unstructured":"Gasieniec, L., Hamilton, D.D., Martin, R., Spirakis, P.G., Stachowiak, G.: Deterministic population protocols for exact majority and plurality. In: Fatourou, P., Jim\u00e9nez, E., Pedone, F. (eds.) 20th International Conference on Principles of Distributed Systems, OPODIS 2016, 13\u201316 December 2016, Madrid, Spain. LIPIcs, vol.\u00a070, pp. 14:1\u201314:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2016). https:\/\/doi.org\/10.4230\/LIPICS.OPODIS.2016.14","DOI":"10.4230\/LIPICS.OPODIS.2016.14"},{"issue":"9","key":"13_CR21","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/32.92911","volume":"17","author":"M Gouda","year":"1991","unstructured":"Gouda, M., Herman, T.: Adaptive programming. IEEE Trans. Software Eng. 17(9), 911\u2013921 (1991). https:\/\/doi.org\/10.1109\/32.92911","journal-title":"IEEE Trans. Software Eng."},{"key":"13_CR22","doi-asserted-by":"publisher","unstructured":"Huang, P., et al.: Gray failure. In: Proceedings of the 16th Workshop on Hot Topics in Operating Systems - HotOS 2017. ACM Press (2017). https:\/\/doi.org\/10.1145\/3102980.3103005","DOI":"10.1145\/3102980.3103005"},{"key":"13_CR23","doi-asserted-by":"publisher","unstructured":"Leroux, J.: Vector addition system reversible reachability problem. Log. Methods Comput. Sci. 9(1) (2013). https:\/\/doi.org\/10.2168\/LMCS-9(1:5)2013","DOI":"10.2168\/LMCS-9(1:5)2013"},{"key":"13_CR24","unstructured":"Raskin, M.: Modular population protocols. CoRR (2024). https:\/\/arxiv.org\/abs\/2111.11983v3"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Viroli, M., Audrito, G., Beal, J., Damiani, F., Pianini, D.: Engineering resilient collective adaptive systems by self-stabilisation. ACM Trans. Model. Comput. Simul. (TOMACS) 28, 1\u201328 (2017). https:\/\/api.semanticscholar.org\/CorpusID:4302945","DOI":"10.1145\/3177774"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74580-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,26]],"date-time":"2024-12-26T16:03:17Z","timestamp":1735228997000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74580-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,27]]},"ISBN":["9783031745799","9783031745805"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74580-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,12,27]]},"assertion":[{"value":"27 December 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author(s) have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Egham","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2024\/algowin\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}