{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T21:12:27Z","timestamp":1792185147113,"version":"4.4.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319961446","type":"print"},{"value":"9783319961453","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96145-3_34","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T18:25:55Z","timestamp":1532111155000},"page":"604-611","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Peregrine: A Tool for the Analysis of Population Protocols"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2914-2734","authenticated-orcid":false,"given":"Michael","family":"Blondin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9862-4919","authenticated-orcid":false,"given":"Javier","family":"Esparza","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5789-8091","authenticated-orcid":false,"given":"Stefan","family":"Jaax","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"key":"34_CR1","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: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 290\u2013299 (2004). \nhttps:\/\/doi.org\/10.1145\/1011767.1011810","DOI":"10.1145\/1011767.1011810"},{"issue":"2","key":"34_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s00446-008-0059-z","volume":"21","author":"D Angluin","year":"2008","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D.: A simple population protocol for fast robust approximate majority. Distrib. Comput. 21(2), 87\u2013102 (2008). \nhttps:\/\/doi.org\/10.1007\/s00446-008-0059-z","journal-title":"Distrib. Comput."},{"issue":"4","key":"34_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s00446-007-0040-2","volume":"20","author":"D Angluin","year":"2007","unstructured":"Angluin, D., Aspnes, J., Eisenstat, D., Ruppert, E.: The computational power of population protocols. Distrib. Comput. 20(4), 279\u2013304 (2007). \nhttps:\/\/doi.org\/10.1007\/s00446-007-0040-2","journal-title":"Distrib. Comput."},{"key":"34_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-89707-1_5","volume-title":"Middleware for Network Eccentric and Mobile Applications","author":"J Aspnes","year":"2009","unstructured":"Aspnes, J., Ruppert, E.: An introduction to population protocols. In: Garbinato, B., Miranda, H., Rodrigues, L. (eds.) Middleware for Network Eccentric and Mobile Applications, pp. 97\u2013120. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-540-89707-1_5"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.tcs.2012.10.032","volume":"512","author":"J Beauquier","year":"2013","unstructured":"Beauquier, J., Blanchard, P., Burman, J., Dela\u00ebt, S.: Tight complexity analysis of population protocols with cover times - the ZebraNet example. Theor. Comput. Sci. 512, 15\u201327 (2013). \nhttps:\/\/doi.org\/10.1016\/j.tcs.2012.10.032","journal-title":"Theor. Comput. Sci."},{"key":"34_CR6","doi-asserted-by":"publisher","unstructured":"Blondin, M., Esparza, J., Jaax, S., Meyer, P.J.: Towards efficient verification of population protocols. In: Proceedings of the 36th ACM Symposium on Principles of Distributed Computing (PODC), pp. 423\u2013430 (2017). \nhttps:\/\/doi.org\/10.1145\/3087801.3087816","DOI":"10.1145\/3087801.3087816"},{"key":"34_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/978-3-319-63390-9_20","volume-title":"Computer Aided Verification","author":"L Cardelli","year":"2017","unstructured":"Cardelli, L., \u010ce\u0161ka, M., Fr\u00e4nzle, M., Kwiatkowska, M., Laurenti, L., Paoletti, N., Whitby, M.: Syntax-guided optimal synthesis for chemical reaction networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 375\u2013395. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63390-9_20"},{"key":"34_CR8","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.biosystems.2016.09.004","volume":"149","author":"L Cardelli","year":"2016","unstructured":"Cardelli, L., Kwiatkowska, M., Laurenti, L.: Stochastic analysis of chemical reaction networks using linear noise approximation. Biosystems 149, 26\u201333 (2016). \nhttps:\/\/doi.org\/10.1016\/j.biosystems.2016.09.004","journal-title":"Biosystems"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-319-63121-9_23","volume-title":"Models, Algorithms, Logics and Tools","author":"L Cardelli","year":"2017","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Syntactic Markovian bisimulation for chemical reaction networks. In: Aceto, L., et al. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 466\u2013483. Springer, Cham (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-319-63121-9_23"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16023-3_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"I Chatzigiannakis","year":"2010","unstructured":"Chatzigiannakis, I., Michail, O., Spirakis, P.G.: Algorithmic verification of population protocols. In: Dolev, S., Cobb, J., Fischer, M., Yung, M. (eds.) SSS 2010. LNCS, vol. 6366, pp. 221\u2013235. Springer, Heidelberg (2010). \nhttps:\/\/doi.org\/10.1007\/978-3-642-16023-3_19"},{"key":"34_CR11","doi-asserted-by":"publisher","unstructured":"Cl\u00e9ment, J., Delporte-Gallet, C., Fauconnier, H., Sighireanu, M.: Guidelines for the verification of population protocols. In: ICDCS, pp. 215\u2013224. IEEE Computer Society (2011). \nhttps:\/\/doi.org\/10.1109\/ICDCS.2011.36","DOI":"10.1109\/ICDCS.2011.36"},{"issue":"2","key":"34_CR12","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s11047-015-9501-x","volume":"15","author":"R Cummings","year":"2016","unstructured":"Cummings, R., Doty, D., Soloveichik, D.: Probability 1 computation with chemical reaction networks. Nat. Comput. 15(2), 245\u2013261 (2016). \nhttps:\/\/doi.org\/10.1007\/s11047-015-9501-x","journal-title":"Nat. Comput."},{"issue":"1","key":"34_CR13","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BF03160228","volume":"6","author":"Z Diamadi","year":"2001","unstructured":"Diamadi, Z., Fischer, M.J.: A simple game for the study of trust in distributed systems. Wuhan Univ. J. Nat. Sci. 6(1), 72\u201382 (2001). \nhttps:\/\/doi.org\/10.1007\/BF03160228","journal-title":"Wuhan Univ. J. Nat. Sci."},{"issue":"1","key":"34_CR14","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1017\/S0305004100033193","volume":"54","author":"PAP Moran","year":"1958","unstructured":"Moran, P.A.P.: Random processes in genetics. Math. Proc. Cambridge Philos. Soc. 54(1), 60\u201371 (1958). \nhttps:\/\/doi.org\/10.1017\/S0305004100033193","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"34_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Moura de","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78800-3_24\n\n. z3 is available at \nhttps:\/\/github.com\/Z3Prover\/z3"},{"issue":"1","key":"34_CR16","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/2678280","volume":"58","author":"S Navlakha","year":"2014","unstructured":"Navlakha, S., Bar-Joseph, Z.: Distributed information processing in biological and computational systems. Commun. ACM 58(1), 94\u2013102 (2014). \nhttps:\/\/doi.org\/10.1145\/2678280","journal-title":"Commun. ACM"},{"key":"34_CR17","doi-asserted-by":"publisher","unstructured":"Pang, J., Luo, Z., Deng, Y.: On automatic verification of self-stabilizing population protocols. In: Proceedings of the 2nd IEEE\/IFIP International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 185\u2013192 (2008). \nhttps:\/\/doi.org\/10.1109\/TASE.2008.8","DOI":"10.1109\/TASE.2008.8"},{"key":"34_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/3-540-44988-4_27","volume-title":"Application and Theory of Petri Nets 2000","author":"K Schmidt","year":"2000","unstructured":"Schmidt, K.: LoLA a low level analyser. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol. 1825, pp. 465\u2013474. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/3-540-44988-4_27\n\n. LoLA is available at \nhttp:\/\/service-technology.org\/lola\/"},{"issue":"4","key":"34_CR19","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/s11047-008-9067-y","volume":"7","author":"D Soloveichik","year":"2008","unstructured":"Soloveichik, D., Cook, M., Winfree, E., Bruck, J.: Computation with finite stochastic chemical reaction networks. Nat. Comput. 7(4), 615\u2013633 (2008). \nhttps:\/\/doi.org\/10.1007\/s11047-008-9067-y","journal-title":"Nat. Comput."},{"key":"34_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1007\/978-3-642-02658-4_59","volume-title":"Computer Aided Verification","author":"J Sun","year":"2009","unstructured":"Sun, J., Liu, Y., Dong, J.S., Pang, J.: PAT: towards flexible verification under fairness. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 709\u2013714. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-02658-4_59"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96145-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T18:55:23Z","timestamp":1532112923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96145-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961446","9783319961453"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96145-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}