{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,7]],"date-time":"2026-09-07T22:22:13Z","timestamp":1788819733930,"version":"build-2803163510"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662545799","type":"print"},{"value":"9783662545805","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-662-54580-5_19","type":"book-chapter","created":{"date-parts":[[2017,3,30]],"date-time":"2017-03-30T06:50:09Z","timestamp":1490856609000},"page":"310-328","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":50,"title":["ERODE: A Tool for the Evaluation and Reduction of Ordinary Differential Equations"],"prefix":"10.1007","author":[{"given":"Luca","family":"Cardelli","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":[[2017,3,31]]},"reference":[{"issue":"2","key":"19_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.3233\/JCS-2004-12202","volume":"12","author":"A Aldini","year":"2004","unstructured":"Aldini, A., Bravetti, M., Gorrieri, R.: A process-algebraic approach for the analysis of probabilistic noninterference. JCS 12(2), 191\u2013245 (2004)","journal-title":"JCS"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1109\/TAC.1968.1098900","volume":"13","author":"M Aoki","year":"1968","unstructured":"Aoki, M.: Control of large-scale dynamic systems by aggregation. IEEE Trans. Autom. Control 13(3), 246\u2013253 (1968)","journal-title":"IEEE Trans. Autom. Control"},{"key":"19_CR3","unstructured":"Apache Commons Mathematics Library. http:\/\/commons.apache.org\/proper\/commons-math\/"},{"issue":"17","key":"19_CR4","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1093\/bioinformatics\/bth378","volume":"20","author":"ML Blinov","year":"2004","unstructured":"Blinov, M.L., Faeder, J.R., Goldstein, B., Hlavacek, W.S.: Bionetgen: software for rule-based modeling of signal transduction based on the interactions of molecular domains. Bioinformatics 20(17), 3289\u20133291 (2004)","journal-title":"Bioinformatics"},{"issue":"5","key":"19_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/j.peva.2013.01.001","volume":"70","author":"L Bortolussi","year":"2013","unstructured":"Bortolussi, L., Hillston, J., Latella, D., Massink, M.: Continuous approximation of collective system behaviour: a tutorial. Perform. Eval. 70(5), 317\u2013349 (2013)","journal-title":"Perform. Eval."},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-642-40196-1_9","volume-title":"Quantitative Evaluation of Systems","author":"L Bortolussi","year":"2013","unstructured":"Bortolussi, L., Lanciani, R.: Model checking Markov population models by central limit approximation. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 123\u2013138. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40196-1_9"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1017\/S0021900200107338","volume":"31","author":"P Buchholz","year":"1994","unstructured":"Buchholz, P.: Exact and ordinary lumpability in finite Markov Chains. J. Appl. Probab. 31(1), 59\u201375 (1994)","journal-title":"J. Appl. Probab."},{"issue":"1","key":"19_CR8","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1186\/1752-0509-8-84","volume":"8","author":"L Cardelli","year":"2014","unstructured":"Cardelli, L.: Morphisms of reaction networks that couple structure to function. BMC Syst. Biol. 8(1), 84 (2014)","journal-title":"BMC Syst. Biol."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Forward and backward bisimulations for chemical reaction networks. In: CONCUR (2015)","DOI":"10.1145\/2933575.2935318"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Comparing chemical reaction networks: a categorical and algorithmic perspective. In: LICS (2016)","DOI":"10.1145\/2933575.2935318"},{"key":"19_CR11","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). doi:10.1007\/978-3-662-49674-9_6"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Symbolic computation of differential equivalences. In: POPL (2016)","DOI":"10.1145\/2837614.2837649"},{"key":"19_CR13","doi-asserted-by":"crossref","unstructured":"Danos, V., Feret, J., Fontana, W., Harmer, R., Krivine, J.: Abstracting the differential semantics of rule-based models: exact and automated model reduction. In: LICS, pp. 362\u2013381 (2010)","DOI":"10.1109\/LICS.2010.44"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.tcs.2004.03.065","volume":"325","author":"V Danos","year":"2004","unstructured":"Danos, V., Laneve, C.: Formal molecular biology. Theoret. Comput. Sci. 325(1), 69\u2013110 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"19_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","year":"2008","unstructured":"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). doi:10.1007\/978-3-540-78800-3_24"},{"issue":"6","key":"19_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":"1","key":"19_CR17","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1186\/1471-2105-9-356","volume":"9","author":"F Erhard","year":"2008","unstructured":"Erhard, F., Friedel, C.C., Zimmer, R.: FERN - a Java framework for stochastic simulation and evaluation of reaction networks. BMC Bioinform. 9(1), 356 (2008)","journal-title":"BMC Bioinform."},{"issue":"16","key":"19_CR18","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. Proc. Nat. Acad. Sci. 106(16), 6453\u20136458 (2009)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"19_CR19","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2011.12.059","volume":"431","author":"J Feret","year":"2012","unstructured":"Feret, J., Henzinger, T., Koeppl, H., Petrov, T.: Lumpability abstractions of rule-based systems. Theoret. Comput. Sci. 431, 137\u2013164 (2012)","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1239","DOI":"10.1038\/nbt1356","volume":"25","author":"J Fisher","year":"2007","unstructured":"Fisher, J., Henzinger, T.A.: Executable cell biology. Nat. Biotechnol. 25(11), 1239\u20131249 (2007)","journal-title":"Nat. Biotechnol."},{"key":"19_CR21","unstructured":"Microsoft GEC. http:\/\/research.microsoft.com\/en-us\/projects\/gec\/"},{"issue":"25","key":"19_CR22","doi-asserted-by":"publisher","first-page":"2340","DOI":"10.1021\/j100540a008","volume":"81","author":"DT Gillespie","year":"1977","unstructured":"Gillespie, D.T.: Exact stochastic simulation of coupled chemical reactions. J. Phys. Chem. 81(25), 2340\u20132361 (1977)","journal-title":"J. Phys. Chem."},{"key":"19_CR23","unstructured":"Gupta, V., Jagadeesan, R., Panangaden, P.: Approximate reasoning for real-time probabilistic processes. Log. Methods Comput. Sci. 2(1), 1\u201323 (2006)"},{"issue":"22\u201324","key":"19_CR24","doi-asserted-by":"publisher","first-page":"2260","DOI":"10.1016\/j.tcs.2010.02.001","volume":"411","author":"RA Hayden","year":"2010","unstructured":"Hayden, R.A., Bradley, J.T.: A fluid analysis framework for a Markovian process algebra. Theor. Comput. Sci. 411(22\u201324), 2260\u20132297 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR25","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":"19_CR26","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). doi:10.1007\/978-3-662-48057-1_23"},{"issue":"3\u20134","key":"19_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0304-3800(87)90030-5","volume":"37","author":"Y Iwasa","year":"1987","unstructured":"Iwasa, Y., Andreasen, V., Levin, S.: Aggregation in model ecosystems. I. Perfect aggregation. Ecol. Model. 37(3\u20134), 287\u2013302 (1987)","journal-title":"Ecol. Model."},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-31365-3_27","volume-title":"Automated Reasoning","author":"D Jovanovi\u0107","year":"2012","unstructured":"Jovanovi\u0107, D., Moura, L.: Solving non-linear arithmetic. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS (LNAI), vol. 7364, pp. 339\u2013354. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-31365-3_27"},{"key":"19_CR29","doi-asserted-by":"crossref","unstructured":"Katoen, J.-P., Khattri, M., Zapreev, I.S.: A Markov reward model checker. In: QEST, pp. 243\u2013244 (2005)","DOI":"10.1109\/QEST.2005.2"},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Kowal, M., Tschaikowski, M., Tribastone, M., Schaefer, I.: Scaling size and parameter spaces in variability-aware software performance models. In: ASE (2015)","DOI":"10.1109\/ASE.2015.16"},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","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."},{"issue":"6","key":"19_CR32","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1016\/0009-2509(89)85014-6","volume":"44","author":"G Li","year":"1989","unstructured":"Li, G., Rabitz, H.: A general analysis of exact lumping in chemical kinetics. Chem. Eng. Sci. 44(6), 1413\u20131430 (1989)","journal-title":"Chem. Eng. Sci."},{"issue":"6","key":"19_CR33","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-540-45187-7_33","volume-title":"CONCUR 2003 - Concurrency Theory","author":"A Pierro","year":"2003","unstructured":"Pierro, A., Hankin, C., Wiklicky, H.: Quantitative relations and approximate process equivalences. In: Amadio, R., Lugiez, D. (eds.) CONCUR 2003. LNCS, vol. 2761, pp. 508\u2013522. Springer, Heidelberg (2003). doi:10.1007\/978-3-540-45187-7_33"},{"issue":"6905","key":"19_CR35","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1038\/419343a","volume":"419","author":"A Regev","year":"2002","unstructured":"Regev, A., Shapiro, E.: Cellular abstractions: cells as computation. Nature 419(6905), 343\u2013343 (2002)","journal-title":"Nature"},{"issue":"2","key":"19_CR36","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1038\/nmeth.1546","volume":"8","author":"MW Sneddon","year":"2011","unstructured":"Sneddon, M.W., Faeder, J.R., Emonet, T.: Efficient modeling, simulation and coarse-graining of biological complexity with NFsim. Nat. Methods 8(2), 177\u2013183 (2011)","journal-title":"Nat. Methods"},{"issue":"1","key":"19_CR37","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/TSE.2010.82","volume":"38","author":"M Tribastone","year":"2012","unstructured":"Tribastone, M., Gilmore, S., Hillston, J.: Scalable differential analysis of process algebra models. IEEE Trans. Softw. Eng. 38(1), 205\u2013219 (2012)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"19_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/978-3-642-32940-1_27","volume-title":"CONCUR 2012 \u2013 Concurrency Theory","author":"M Tschaikowski","year":"2012","unstructured":"Tschaikowski, M., Tribastone, M.: Exact fluid lumpability for markovian process algebra. In: Koutny, M., Ulidowski, I. (eds.) CONCUR 2012. LNCS, vol. 7454, pp. 380\u2013394. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32940-1_27"},{"issue":"2","key":"19_CR39","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.jlamp.2014.10.004","volume":"84","author":"M Tschaikowski","year":"2015","unstructured":"Tschaikowski, M., Tribastone, M.: A unified framework for differential aggregations in Markovian process algebra. J. Log. Algebr. Meth. Program. 84(2), 238\u2013258 (2015)","journal-title":"J. Log. Algebr. Meth. Program."},{"key":"19_CR40","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/TAC.2015.2457172","volume":"61","author":"M Tschaikowski","year":"2016","unstructured":"Tschaikowski, M., Tribastone, M.: Approximate reduction of heterogenous nonlinear models with differential hulls. IEEE Trans. Autom. Control 61, 1099\u20131104 (2016)","journal-title":"IEEE Trans. Autom. Control"},{"key":"19_CR41","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). doi:10.1007\/978-3-642-12002-2_4"},{"issue":"1\u20133","key":"19_CR42","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.tcs.2006.05.021","volume":"360","author":"F van Breugel","year":"2006","unstructured":"van Breugel, F., Worrell, J.: Approximating, computing behavioural distances in probabilistic transition systems. Theoret. Comput. Sci. 360(1\u20133), 373\u2013385 (2006)","journal-title":"Theoret. Comput. Sci."},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-34096-8_7","volume-title":"Formal Methods for the Quantitative Evaluation of Collective Adaptive Systems","author":"A Vandin","year":"2016","unstructured":"Vandin, A., Tribastone, M.: Quantitative abstractions for collective adaptive systems. In: Bernardo, M., Nicola, R., Hillston, J. (eds.) SFM 2016. LNCS, vol. 9700, pp. 202\u2013232. Springer, Heidelberg (2016). doi:10.1007\/978-3-319-34096-8_7"},{"key":"19_CR44","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1155\/2013\/897658","volume":"2013","author":"EO Voit","year":"2013","unstructured":"Voit, E.O.: Biochemical systems theory: a review. ISRN Biomath. 2013, 53 (2013)","journal-title":"ISRN Biomath."}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-54580-5_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,21]],"date-time":"2021-04-21T02:54:06Z","timestamp":1618973646000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-54580-5_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783662545799","9783662545805"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-54580-5_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"31 March 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TACAS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Tools and Algorithms for the Construction and Analysis of Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 April 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tacas2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.etaps.org\/index.php\/2017\/tacas","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}