{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T23:55:13Z","timestamp":1780444513038,"version":"3.54.1"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030034238","type":"print"},{"value":"9783030034245","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","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":[[2018]]},"DOI":"10.1007\/978-3-030-03424-5_13","type":"book-chapter","created":{"date-parts":[[2018,10,30]],"date-time":"2018-10-30T13:58:12Z","timestamp":1540907892000},"page":"186-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Differential Equivalence Yields Network Centrality"],"prefix":"10.1007","author":[{"given":"Stefano","family":"Tognazzi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirco","family":"Tribastone","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Max","family":"Tschaikowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andrea","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,10,31]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/1502793.1502794","volume":"56","author":"S Arora","year":"2009","unstructured":"Arora, S., Rao, S., Vazirani, U.V.: Expander flows, geometric embeddings and graph partitioning. J. ACM 56(2), 5:1\u20135:37 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1006\/jcss.1999.1683","volume":"60","author":"C Baier","year":"2000","unstructured":"Baier, C., Engelen, B., Majster-Cederbaum, M.E.: Deciding bisimilarity and similarity for probabilistic processes. J. Comput. Syst. Sci. 60(1), 187\u2013231 (2000)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Barabasi, A.-L., Dezso, Z., Regan, E., Yook, S.-H., Oltvai, Z.: Scale-free and hierarchical structures in complex networks, vol. 661, no. 1 (2003)","DOI":"10.1063\/1.1571285"},{"key":"13_CR4","unstructured":"Batagelj, V., Mrvar, A.: Pajek datasets, June 2006. http:\/\/vlado.fmf.uni-lj.si\/pub\/networks\/data\/"},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"Bobbio, A., Gribaudo, M., Telek, M.: Analysis of large scale interacting systems by mean field method. In: QEST, pp. 215\u2013224 (2008)","DOI":"10.1109\/QEST.2008.47"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Bortolussi, L., Gast, N.: Mean field approximation of uncertain stochastic models. In: DSN, pp. 287\u2013298 (2016)","DOI":"10.1109\/DSN.2016.34"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2307\/3215235","volume":"31","author":"P Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov chains. J. Appl. Probab. 31, 59\u201374 (1994)","journal-title":"J. Appl. Probab."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Csik\u00e1sz-Nagy, A., Dalchau, N., Tribastone, M., Tschaikowski, M.: Noise Reduction in complex biological switches. Sci. Rep. (2016)","DOI":"10.1038\/srep20214"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-662-49674-9_6","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Cardelli","year":"2016","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Efficient syntax-driven lumping of differential equations. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 93\u2013111. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_6"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Forward and backward bisimulations for chemical reaction networks. In: CONCUR, pp. 226\u2013239 (2015)","DOI":"10.1145\/2933575.2935318"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Comparing chemical reaction networks: a categorical and algorithmic perspective. In: LICS, pp. 485\u2013494 (2016)","DOI":"10.1145\/2933575.2935318"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Symbolic computation of differential equivalences. In: 43rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) (2016)","DOI":"10.1145\/2837614.2837649"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-662-54580-5_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L Cardelli","year":"2017","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: ERODE: a tool for the evaluation and reduction of ordinary differential equations. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10206, pp. 310\u2013328. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54580-5_19"},{"issue":"38","key":"13_CR14","doi-asserted-by":"publisher","first-page":"10029","DOI":"10.1073\/pnas.1702697114","volume":"114","author":"L Cardelli","year":"2017","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Maximal aggregation of polynomial dynamical systems. PNAS 114(38), 10029\u201310034 (2017)","journal-title":"PNAS"},{"issue":"1","key":"13_CR15","first-page":"1:1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Yifan, H.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. 38(1), 1:1\u20131:25 (2011)","journal-title":"ACM Trans. Math. Softw."},{"issue":"6","key":"13_CR16","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S Derisavi","year":"2003","unstructured":"Derisavi, S., Hermanns, H., Sanders, W.H.: Optimal state-space lumping in Markov chains. Inf. Process. Lett. 87(6), 309\u2013315 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"16","key":"13_CR17","doi-asserted-by":"publisher","first-page":"6453","DOI":"10.1073\/pnas.0809908106","volume":"106","author":"J Feret","year":"2009","unstructured":"Feret, J., Danos, V., Krivine, J., Harmer, R., Fontana, W.: Internal coarse-graining of molecular systems. PNAS 106(16), 6453\u20136458 (2009)","journal-title":"PNAS"},{"key":"13_CR18","volume-title":"Matrix Computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"Iacobelli, G., Tribastone, M.: Lumpability of fluid models with heterogeneous agent types. In: DSN, pp. 1\u201311 (2013)","DOI":"10.1109\/DSN.2013.6575346"},{"key":"13_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-662-48057-1_23","volume-title":"Mathematical Foundations of Computer Science 2015","author":"G Iacobelli","year":"2015","unstructured":"Iacobelli, G., Tribastone, M., Vandin, A.: Differential bisimulation for a Markovian process algebra. In: Italiano, G.F., Pighizzini, G., Sannella, D.T. (eds.) MFCS 2015. LNCS, vol. 9234, pp. 293\u2013306. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48057-1_23"},{"issue":"6833","key":"13_CR21","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1038\/35075138","volume":"411","author":"H Jeong","year":"2001","unstructured":"Jeong, H., Mason, S.P., Barabasi, A.-L., Oltvai, Z.N.: Lethality and centrality in protein networks. Nature 411(6833), 41\u201342 (2001)","journal-title":"Nature"},{"issue":"2","key":"13_CR22","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.peva.2010.04.001","volume":"68","author":"J-P Katoen","year":"2011","unstructured":"Katoen, J.-P., Zapreev, I.S., Hahn, E.M., Hermanns, H., Jansen, D.N.: The ins and outs of the probabilistic model checker MRMC. Perform. Eval. 68(2), 90\u2013104 (2011)","journal-title":"Perform. Eval."},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-3-540-30115-8_22","volume-title":"Machine Learning: ECML 2004","author":"B Klimt","year":"2004","unstructured":"Klimt, B., Yang, Y.: The enron corpus: a new dataset for email classification research. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) ECML 2004. LNCS (LNAI), vol. 3201, pp. 217\u2013226. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30115-8_22"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Kowal, M., Tschaikowski, M., Tribastone, M., Schaefer, I.: Scaling size and parameter spaces in variability-aware software performance models (T). In: ASE, pp. 407\u2013417 (2015)","DOI":"10.1109\/ASE.2015.16"},{"key":"13_CR25","doi-asserted-by":"crossref","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. In: POPL, pp. 344\u2013352 (1989)","DOI":"10.1145\/75277.75307"},{"key":"13_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/978-3-540-31955-9_9","volume-title":"Network Analysis: Methodological Foundations","author":"J Lerner","year":"2005","unstructured":"Lerner, J.: Role assignments. In: Brandes, U., Erlebach, T. (eds.) Network Analysis: Methodological Foundations. LNCS, vol. 3418, pp. 216\u2013252. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31955-9_9"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graphs over time: densification laws, shrinking diameters and possible explanations. In: KDD 2005, pp. 177\u2013187 (2005)","DOI":"10.1145\/1081870.1081893"},{"issue":"1","key":"13_CR28","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec, J., Kleinberg, J., Faloutsos, C.: Graph evolution: densification and shrinking diameters. ACM Trans. Knowl. Discov. Data 1(1), 2 (2007)","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"13_CR29","unstructured":"Leskovec, J., Krevl, A.: SNAP datasets: Stanford large network dataset collection, June 2014. http:\/\/snap.stanford.edu\/data"},{"key":"13_CR30","unstructured":"Meila, M., Shi, J.: Learning segmentation by random walks. In: NIPS 2000, Denver, pp. 873\u2013879 (2000)"},{"key":"13_CR31","doi-asserted-by":"crossref","unstructured":"Mislove, A., Marcon, M., Gummadi, K.P., Druschel, P., Bhattacharjee, B.: Measurement and analysis of online social networks. In: Proceedings of the 5th ACM\/Usenix Internet Measurement Conference (IMC 2007), San Diego, October 2007","DOI":"10.1145\/1298306.1298311"},{"key":"13_CR32","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199206650.001.0001","volume-title":"Networks: An Introduction","author":"M Newman","year":"2010","unstructured":"Newman, M.: Networks: An Introduction. Oxford University Press Inc., New York (2010)"},{"issue":"6","key":"13_CR33","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"13_CR34","doi-asserted-by":"publisher","first-page":"026112","DOI":"10.1103\/PhysRevE.67.026112","volume":"67","author":"E Ravasz","year":"2003","unstructured":"Ravasz, E., Barab\u00e1si, A.-L.: Hierarchical organization in complex networks. Phys. Rev. E 67, 026112 (2003)","journal-title":"Phys. Rev. E"},{"issue":"8","key":"13_CR35","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1109\/34.868688","volume":"22","author":"J Shi","year":"2000","unstructured":"Shi, J., Malik, J.: Normalized cuts and image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 22(8), 888\u2013905 (2000)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"13_CR36","doi-asserted-by":"crossref","unstructured":"Tschaikowski, M., Tribastone, M.: Exact fluid lumpability for markovian process algebra. In: CONCUR, pp. 380\u2013394 (2012)","DOI":"10.1007\/978-3-642-32940-1_27"},{"issue":"4","key":"13_CR37","first-page":"1099","volume":"61","author":"M Tschaikowski","year":"2016","unstructured":"Tschaikowski, M., Tribastone, M.: Approximate reduction of heterogenous nonlinear models with differential hulls. IEEE TAC 61(4), 1099\u20131104 (2016)","journal-title":"IEEE TAC"},{"key":"13_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-12002-2_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Valmari","year":"2010","unstructured":"Valmari, A., Franceschinis, G.: Simple O(m logn) time Markov chain lumping. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol. 6015, pp. 38\u201352. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12002-2_4"},{"key":"13_CR39","unstructured":"Vinnikov, A., Shalev-Shwartz, S.: K-means recovers ICA filters when independent components are sparse. In: ICML 2014, Beijing, 21\u201326 June 2014, pp. 712\u2013720 (2014)"},{"key":"13_CR40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511815478","volume-title":"Social Network Analysis: Methods and Applications","author":"S Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social Network Analysis: Methods and Applications, vol. 8. Cambridge University Press, Cambridge (1994)"}],"container-title":["Lecture Notes in Computer Science","Leveraging Applications of Formal Methods, Verification and Validation. Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03424-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,4]],"date-time":"2022-09-04T22:38:15Z","timestamp":1662331095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03424-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030034238","9783030034245"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03424-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 October 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISoLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Leveraging Applications of Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Limassol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cyprus","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"isola2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.isola-conference.org\/isola2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Equinocs","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"126","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"85% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"invitation-based event","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}