{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:51Z","timestamp":1760202711227},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602240"},{"type":"electronic","value":"9783319602257"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60225-7_10","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T02:26:37Z","timestamp":1495851997000},"page":"139-155","source":"Crossref","is-referenced-by-count":2,"title":["Weak Simulation Quasimetric in a Gossip Scenario"],"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"}]},{"given":"Simone","family":"Tini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ipl.2003.10.001","volume":"89","author":"C Baier","year":"2004","unstructured":"Baier, C., Hermanns, H., Katoen, J.P.: Probabilistic weak simulation is decidable in polynomial time. Inf. Process. Lett. 89(3), 123\u2013130 (2004)","journal-title":"Inf. Process. Lett."},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-45694-5_23","volume-title":"CONCUR 2002 \u2014 Concurrency Theory","author":"C Baier","year":"2002","unstructured":"Baier, C., Katoen, J.-P., Hermanns, H., Haverkort, B.: Simulation for continuous-time Markov chains. In: Brim, L., K\u0159et\u00ednsk\u00fd, M., Ku\u010dera, A., Jan\u010dar, P. (eds.) CONCUR 2002. LNCS, vol. 2421, pp. 338\u2013354. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45694-5_23"},{"issue":"5","key":"10_CR3","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1145\/1317379.1317385","volume":"41","author":"R Bakhshi","year":"2007","unstructured":"Bakhshi, R., Bonnet, F., Fokkink, W., Haverkort, B.: Formal analysis techniques for gossiping protocols. Oper. Syst. Rev. 41(5), 28\u201336 (2007)","journal-title":"Oper. Syst. Rev."},{"issue":"1","key":"10_CR4","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.tcs.2004.09.035","volume":"331","author":"F Breugel van","year":"2005","unstructured":"van Breugel, F., Worrell, J.: A behavioural pseudometric for probabilistic transition systems. Theoret. Comput. Sci. 331(1), 115\u2013142 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Cerone, A., Hennessy, M., Merro, M.: Modelling MAC-layer communications in wireless systems. Log. Methods Comput. Sci. 11(1:18) (2015)","DOI":"10.2168\/LMCS-11(1:18)2015"},{"issue":"2","key":"10_CR6","first-page":"79","volume":"153","author":"Y Deng","year":"2006","unstructured":"Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for action-labelled quantitative transition systems. ENTCS 153(2), 79\u201396 (2006)","journal-title":"ENTCS"},{"issue":"3","key":"10_CR7","first-page":"73","volume":"253","author":"Y Deng","year":"2009","unstructured":"Deng, Y., Du, W.: The Kantorovich metric in computer science: a brief survey. ENTCS 253(3), 73\u201382 (2009)","journal-title":"ENTCS"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Deng, Y., van Glabbeek, R.J., Hennessy, M., Morgan, C.: Characterising testing preorders for finite probabilistic processes. Log. Meth. Comput. Sci. 4(4) (2008)","DOI":"10.2168\/LMCS-4(4:4)2008"},{"issue":"3","key":"10_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, J., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theoret. Comput. Sci. 318(3), 323\u2013354 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: LICS 2002, pp. 413\u2013422 (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"key":"10_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/11814764_12","volume-title":"Ad-Hoc, Mobile, and Wireless Networks","author":"A Fehnker","year":"2006","unstructured":"Fehnker, A., Gao, P.: Formal verification and simulation for performance analysis for probabilistic broadcast protocols. In: Kunz, T., Ravi, S.S. (eds.) ADHOC-NOW 2006. LNCS, vol. 4104, pp. 128\u2013141. Springer, Heidelberg (2006). doi: 10.1007\/11814764_12"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-662-46678-0_15","volume-title":"Foundations of Software Science and Computation Structures","author":"D Gebler","year":"2015","unstructured":"Gebler, D., Larsen, K.G., Tini, S.: Compositional metric reasoning with probabilistic process calculi. In: Pitts, A. (ed.) FoSSaCS 2015. LNCS, vol. 9034, pp. 230\u2013245. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46678-0_15"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Gebler, D., Larsen, K.G., Tini, S.: Compositional bisimulation metric reasoning with probabilistic process calculi. Log. Meth. Comput. Sci. 12(4) (2016)","DOI":"10.2168\/LMCS-12(4:12)2016"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Gebler, D., Tini, S.: Fixed-point characterization of compositionality properties of probabilistic processes combinators. In: Borgstr\u00f6m, J., Crafa, S. (eds.) EXPRESS\/SOS 2014, EPTCS, vol. 160, pp. 63\u201378 (2014)","DOI":"10.4204\/EPTCS.160.7"},{"key":"10_CR15","unstructured":"Gebler, D., Tini, S.: SOS specifications of probabilistic systems by uniformly continuous operators. In: Aceto, L., Frutos-Escrig, D. (eds.) CONCUR 2015, LIPIcs, vol. 42, pp. 155\u2013168. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Jonsson, B., Larsen, K.G., Yi, W.: Probabilistic extensions of process algebras. In: Handbook of Process Algebra, pp. 685\u2013710. Elsevier (2001)","DOI":"10.1016\/B978-044482830-9\/50029-1"},{"issue":"5","key":"10_CR17","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1317379.1317381","volume":"41","author":"AM Kermarrec","year":"2007","unstructured":"Kermarrec, A.M., van Steen, M.: Gossiping in distributed systems. Oper. Syst. Rev. 41(5), 2\u20137 (2007)","journal-title":"Oper. Syst. Rev."},{"issue":"3","key":"10_CR18","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1481506.1481511","volume":"36","author":"M Kwiatkowska","year":"2008","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Analysis of a gossip protocol in PRISM. SIGMETRICS Perform. Eval. Rev. 36(3), 17\u201322 (2008)","journal-title":"SIGMETRICS Perform. Eval. Rev."},{"key":"10_CR19","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). doi: 10.1007\/978-3-642-23217-6_11"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-39519-7_10","volume-title":"Coordination Models and Languages","author":"R Lanotte","year":"2016","unstructured":"Lanotte, R., Merro, M.: A semantic theory of the internet of things. In: Lluch Lafuente, A., Proen\u00e7a, J. (eds.) COORDINATION 2016. LNCS, vol. 9686, pp. 157\u2013174. Springer, Cham (2016). doi: 10.1007\/978-3-319-39519-7_10"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-319-53733-7_8","volume-title":"Language and Automata Theory and Applications","author":"R Lanotte","year":"2017","unstructured":"Lanotte, R., Merro, M.: A calculus of cyber-physical systems. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 115\u2013127. Springer, Cham (2017). doi: 10.1007\/978-3-319-53733-7_8"},{"issue":"1","key":"10_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"KG Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. Comput. 94(1), 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"10_CR23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.scico.2013.01.005","volume":"81","author":"D Macedonio","year":"2014","unstructured":"Macedonio, D., Merro, M.: A semantic analysis of key management protocols for wireless sensor networks. Sci. Comput. Program. 81, 53\u201378 (2014)","journal-title":"Sci. Comput. Program."},{"issue":"47","key":"10_CR24","doi-asserted-by":"crossref","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. Theoret. Comput. Sci. 412(47), 6585\u20136611 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR25","first-page":"250","volume":"2","author":"R Segala","year":"1995","unstructured":"Segala, R., Lynch, N.: Probabilistic simulations for probabilistic processes. Nord. J. Comput. 2, 250\u2013273 (1995)","journal-title":"Nord. J. Comput."},{"key":"10_CR26","volume-title":"Optimal Transport","author":"C Villani","year":"2008","unstructured":"Villani, C.: Optimal Transport. Old and New. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60225-7_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T05:19:53Z","timestamp":1569388793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60225-7_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602240","9783319602257"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60225-7_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}