{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T00:24:27Z","timestamp":1787271867695,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031684159","type":"print"},{"value":"9783031684166","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68416-6_8","type":"book-chapter","created":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T07:02:40Z","timestamp":1724828560000},"page":"125-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Dissimilarity for\u00a0Linear Dynamical Systems"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Bacci","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Bacci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kim Guldstrand","family":"Larsen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giuseppe","family":"Squillace","sequence":"additional","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":[[2024,8,29]]},"reference":[{"key":"8_CR1","unstructured":"Althoff, M.: An introduction to CORA 2015. In: Proceedings of the Workshop on Applied Verification for Continuous and Hybrid Systems (2015)"},{"key":"8_CR2","doi-asserted-by":"publisher","unstructured":"Antoulas, A.C.: Approximation of Large-Scale Dynamical Systems. SIAM (2005). https:\/\/doi.org\/10.1137\/1.9780898718713","DOI":"10.1137\/1.9780898718713"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S0960129517000160","volume":"29","author":"G Bacci","year":"2019","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: Converging from branching to linear metrics on Markov chains. Math. Struct. Comput. Sci. 29(1), 3\u201337 (2019)","journal-title":"Math. Struct. Comput. Sci."},{"key":"8_CR4","doi-asserted-by":"publisher","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Tribastone, M., Tschaikowski, M., Vandin, A.: Efficient local computation of differential bisimulations via coupling and up-to methods. In: 36th Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2021, Rome, Italy, 29 June\u20132 July 2021, pp. 1\u201314. IEEE (2021). https:\/\/doi.org\/10.1109\/LICS52264.2021.9470555","DOI":"10.1109\/LICS52264.2021.9470555"},{"key":"8_CR5","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On the metric-based approximate minimization of Markov chains. In: ICALP. LIPIcs, vol.\u00a080, pp. 104:1\u2013104:14. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"8_CR6","doi-asserted-by":"publisher","unstructured":"Barraud, A.Y.: A numerical algorithm to solve A\u2019XA \u2013 X = \u2013Q. In: CDC, pp. 420\u2013423 (1977). https:\/\/doi.org\/10.1109\/CDC.1977.271607","DOI":"10.1109\/CDC.1977.271607"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-030-31784-3_15","volume-title":"Automated Technology for Verification and Analysis","author":"E Bartocci","year":"2019","unstructured":"Bartocci, E., Kov\u00e1cs, L., Stankovi\u010d, M.: Automatic generation of moment-based invariants for prob-solvable loops. In: Chen, Y.-F., Cheng, C.-H., Esparza, J. (eds.) ATVA 2019. LNCS, vol. 11781, pp. 255\u2013276. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31784-3_15"},{"key":"8_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-662-54458-7_5","volume-title":"Foundations of Software Science and Computation Structures","author":"M Boreale","year":"2017","unstructured":"Boreale, M.: Algebra, coalgebra, and minimization in polynomial differential equations. In: Esparza, J., Murawski, A.S. (eds.) FoSSaCS 2017. LNCS, vol. 10203, pp. 71\u201387. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54458-7_5"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Boreale, M.: Algorithms for exact and approximate linear abstractions of polynomial continuous systems. In: Prandini, M., Deshmukh, J.V. (eds.) HSCC, pp. 207\u2013216. ACM (2018) .https:\/\/doi.org\/10.1145\/3178126.3178137","DOI":"10.1145\/3178126.3178137"},{"issue":"1","key":"8_CR10","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(1), 59\u201375 (1994)","journal-title":"J. Appl. Probab."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Buchholz, P.: Lumpability and nearly-lumpability in hierarchical queueing networks. In: Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium, pp. 82\u201391. IEEE (1995)","DOI":"10.1109\/IPDS.1995.395814"},{"issue":"15","key":"8_CR12","doi-asserted-by":"publisher","first-page":"2175","DOI":"10.1093\/bioinformatics\/btab081","volume":"37","author":"L Cardelli","year":"2021","unstructured":"Cardelli, L., P\u00e9rez-Verona, I.C., Tribastone, M., Tschaikowski, M., Vandin, A., Waizmann, T.: Exact maximal reduction of stochastic reaction networks by species lumping. Bioinformatics 37(15), 2175\u20132182 (2021). https:\/\/doi.org\/10.1093\/bioinformatics\/btab081","journal-title":"Bioinformatics"},{"key":"8_CR13","doi-asserted-by":"publisher","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M.: From electric circuits to chemical networks. Natural Comput. (2019) https:\/\/doi.org\/10.1007\/s11047-019-09761-7","DOI":"10.1007\/s11047-019-09761-7"},{"key":"8_CR14","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":"8_CR15","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":"8_CR16","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":"8_CR17","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. Proc. Natl. Acad. Sci. (PNAS) 114(38), 10029\u201310034 (2017)","journal-title":"Proc. Natl. Acad. Sci. (PNAS)"},{"key":"8_CR18","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., Bacci, G., Bacci, G., Ing\u00f3lfsd\u00f3ttir, A., Legay, A., Mardare, R. (eds.) Models, Algorithms, Logics and Tools. LNCS, vol. 10460, pp. 466\u2013483. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63121-9_23"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/978-3-319-99154-2_7","volume-title":"Quantitative Evaluation of Systems","author":"L Cardelli","year":"2018","unstructured":"Cardelli, L., Tribastone, M., Tschaikowski, M., Vandin, A.: Guaranteed error bounds on approximate model abstractions through reachability analysis. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 104\u2013121. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_7"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Chen, X., \u00c1brah\u00e1m, E., Sankaranarayanan, S.: Taylor model flowpipe construction for non-linear hybrid systems. In: RTSS, pp. 183\u2013192 (2012)","DOI":"10.1109\/RTSS.2012.70"},{"issue":"2","key":"8_CR21","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0890-5401(92)90048-K","volume":"96","author":"A Condon","year":"1992","unstructured":"Condon, A.: The complexity of stochastic games. Inf. Comput. 96(2), 203\u2013224 (1992). https:\/\/doi.org\/10.1016\/0890-5401(92)90048-K","journal-title":"Inf. Comput."},{"key":"8_CR22","first-page":"359","volume-title":"Activity analysis of production and allocation","author":"GB Dantzig","year":"1951","unstructured":"Dantzig, G.B.: Application of the simplex method to a transportation problem. In: Koopmans, T. (ed.) Activity analysis of production and allocation, pp. 359\u2013373. Wiley, New York (1951)"},{"issue":"3","key":"8_CR23","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J Desharnais","year":"2004","unstructured":"Desharnais, J., Gupta, V., Jagadeesan, R., Panangaden, P.: Metrics for labelled Markov processes. Theor. Comput. Sci. 318(3), 323\u2013354 (2004). https:\/\/doi.org\/10.1016\/j.tcs.2003.09.013","journal-title":"Theor. Comput. Sci."},{"key":"8_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-24743-2_22","volume-title":"Hybrid Systems: Computation and Control","author":"A Fehnker","year":"2004","unstructured":"Fehnker, A., Ivan\u010di\u0107, F.: Benchmarks for hybrid systems verification. In: Alur, R., Pappas, G.J. (eds.) HSCC 2004. LNCS, vol. 2993, pp. 326\u2013341. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24743-2_22"},{"key":"8_CR25","doi-asserted-by":"publisher","unstructured":"Feinberg, M.: Chemical reaction network structure and the stability of complex isothermal reactors\u2014I. The deficiency zero and deficiency one theorems. Chem. Eng. Sci. 42(10), 2229\u20132268 (1987).https:\/\/doi.org\/10.1016\/0009-2509(87)80099-4. https:\/\/www.sciencedirect.com\/science\/article\/pii\/0009250987800994","DOI":"10.1016\/0009-2509(87)80099-4"},{"issue":"1","key":"8_CR26","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1287\/mnsc.3.1.24","volume":"3","author":"LR Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Solving the transportation problem. Manag. Sci. 3(1), 24\u201332 (1956)","journal-title":"Manag. Sci."},{"issue":"1\u20133","key":"8_CR27","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0166-5316(94)90015-9","volume":"20","author":"G Franceschinis","year":"1994","unstructured":"Franceschinis, G., Muntz, R.R.: Bounds for quasi-lumpable Markov chains. Perform. Eval. 20(1\u20133), 223\u2013243 (1994)","journal-title":"Perform. Eval."},{"issue":"3","key":"8_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/3308897.3308909","volume":"46","author":"N Gast","year":"2019","unstructured":"Gast, N., Bortolussi, L., Tribastone, M.: Size expansions of mean field approximation: transient and steady-state analysis. ACM SIGMETRICS Perform. Eval. Rev. 46(3), 25\u201326 (2019)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-642-02658-4_47","volume-title":"Computer Aided Verification","author":"K Ghorbal","year":"2009","unstructured":"Ghorbal, K., Goubault, E., Putot, S.: The zonotope abstract domain taylor1+. In: Bouajjani, A., Maler, O. (eds.) CAV 2009. LNCS, vol. 5643, pp. 627\u2013633. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02658-4_47"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-54862-8_19","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K Ghorbal","year":"2014","unstructured":"Ghorbal, K., Platzer, A.: Characterizing algebraic invariants by differential radical invariants. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 279\u2013294. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_19"},{"key":"8_CR31","unstructured":"Giacalone, A., Jou, C.C., Smolka, S.A.: Algebraic reasoning for probabilistic concurrent games. In: IFIP WG 2.2\/2.3, pp. 443\u2013458 (1990)"},{"key":"8_CR32","doi-asserted-by":"publisher","unstructured":"Girard, A., Pappas, G.: Approximate bisimulations for constrained linear systems. In: 44th IEEE Conference on Decision and Control, pp. 4700\u20134705 (2005). https:\/\/doi.org\/10.1109\/CDC.2005.1582904","DOI":"10.1109\/CDC.2005.1582904"},{"key":"8_CR33","doi-asserted-by":"publisher","unstructured":"Girard, A., Pappas, G.: Approximate bisimulations for nonlinear dynamical systems. In: 44th IEEE Conference on Decision and Control, pp. 684\u2013689 (2005). https:\/\/doi.org\/10.1109\/CDC.2005.1582235","DOI":"10.1109\/CDC.2005.1582235"},{"issue":"5","key":"8_CR34","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1109\/TAC.2007.895849","volume":"52","author":"A Girard","year":"2007","unstructured":"Girard, A., Pappas, G.J.: Approximation metrics for discrete and continuous systems. IEEE Trans. Autom. Control 52(5), 782\u2013798 (2007). https:\/\/doi.org\/10.1109\/TAC.2007.895849","journal-title":"IEEE Trans. Autom. Control"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/978-3-030-17462-0_20","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Hartmanns","year":"2019","unstructured":"Hartmanns, A., Klauck, M., Parker, D., Quatmann, T., Ruijters, E.: The quantitative verification benchmark set. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 344\u2013350. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_20"},{"key":"8_CR36","unstructured":"Hasani, R., et al.: Closed-form continuous-depth models. arXiv preprint arXiv:2106.13898 (2021)"},{"key":"8_CR37","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2014.03.018","volume":"599","author":"MA Islam","year":"2015","unstructured":"Islam, M.A., et al.: Model-order reduction of ion channel dynamics using approximate bisimulation. Theor. Comput. Sci. 599, 34\u201346 (2015). https:\/\/doi.org\/10.1016\/j.tcs.2014.03.018","journal-title":"Theor. Comput. Sci."},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-540-71209-1_9","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J-P Katoen","year":"2007","unstructured":"Katoen, J.-P., Kemna, T., Zapreev, I., Jansen, D.N.: Bisimulation minimisation mostly speeds up probabilistic model checking. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol. 4424, pp. 87\u2013101. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71209-1_9"},{"key":"8_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-031-37703-7_3","volume-title":"Computer Aided Verification","author":"M Kori","year":"2023","unstructured":"Kori, M., Ascari, F., Bonchi, F., Bruni, R., Gori, R., Hasuo, I.: Exploiting adjoints in property directed reachability analysis. In: Enea, C., Lal, A. (eds.) CAV 2023, Part II. LNCS, vol. 13965, pp. 41\u201363. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-37703-7_3"},{"issue":"1","key":"8_CR40","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."},{"key":"8_CR41","doi-asserted-by":"crossref","unstructured":"Leontief, W.: Input-Output Economics. OUP E-Books, Oxford University Press (1986)","DOI":"10.1057\/978-1-349-95121-5_1072-1"},{"key":"8_CR42","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctvcm4g0s","volume-title":"Calculus of Variations and Optimal Control Theory: A Concise Introduction","author":"D Liberzon","year":"2011","unstructured":"Liberzon, D.: Calculus of Variations and Optimal Control Theory: A Concise Introduction. Princeton University Press, Princeton (2011)"},{"key":"8_CR43","doi-asserted-by":"crossref","unstructured":"Liu, J., Zhan, N., Zhao, H.: Computing semi-algebraic invariants for polynomial dynamical systems. In: EMSOFT, pp. 97\u2013106 (2011)","DOI":"10.1145\/2038642.2038659"},{"key":"8_CR44","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1038\/nature10011","volume":"473","author":"YY Liu","year":"2011","unstructured":"Liu, Y.Y., Slotine, J.J., Barabasi, A.L.: Controllability of complex networks. Nature 473, 167\u201373 (2011). https:\/\/doi.org\/10.1038\/nature10011","journal-title":"Nature"},{"key":"8_CR45","doi-asserted-by":"publisher","unstructured":"Marin, A., Rossi, S.: On the relations between lumpability and reversibility. In: MASCOTS, pp. 427\u2013432 (2014). https:\/\/doi.org\/10.1109\/MASCOTS.2014.59","DOI":"10.1109\/MASCOTS.2014.59"},{"key":"8_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/BFb0039058","volume-title":"CONCUR \u201990 Theories of Concurrency: Unification and Extension","author":"R De Nicola","year":"1990","unstructured":"De Nicola, R., Montanari, U., Vaandrager, F.: Back and forth bisimulations. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol. 458, pp. 152\u2013165. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0039058"},{"key":"8_CR47","doi-asserted-by":"crossref","unstructured":"Orlin, J.: A faster strongly polynomial minimum cost flow algorithm. In: STOC, pp. 377\u2013387 (1988)","DOI":"10.1145\/62212.62249"},{"key":"8_CR48","doi-asserted-by":"publisher","unstructured":"Peixoto, T.P.: The Netzschleuder network catalogue and repository (2020). https:\/\/doi.org\/10.5281\/zenodo.7839981","DOI":"10.5281\/zenodo.7839981"},{"key":"8_CR49","unstructured":"Perron, L., Furnon, V.: Or-tools. https:\/\/developers.google.com\/optimization\/"},{"key":"8_CR50","series-title":"Wiley Series in Probability and Statistics","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316887","volume-title":"Markov Decision Processes: Discrete Stochastic Dynamic Programming","author":"ML Puterman","year":"1994","unstructured":"Puterman, M.L.: Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley, Hoboken (1994). https:\/\/doi.org\/10.1002\/9780470316887"},{"key":"8_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-319-99154-2_24","volume-title":"Quantitative Evaluation of Systems","author":"M Salamati","year":"2018","unstructured":"Salamati, M., Soudjani, S., Majumdar, R.: Approximate time bounded reachability for CTMCs and CTMDPs: a Lyapunov approach. In: McIver, A., Horvath, A. (eds.) QEST 2018. LNCS, vol. 11024, pp. 389\u2013406. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-99154-2_24"},{"key":"8_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-78800-3_14","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Sankaranarayanan","year":"2008","unstructured":"Sankaranarayanan, S., Dang, T., Ivan\u010di\u0107, F.: Symbolic model checking of hybrid systems using template polyhedra. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 188\u2013202. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_14"},{"key":"8_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/978-3-642-54013-4_6","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"L Song","year":"2014","unstructured":"Song, L., Zhang, L., Godskesen, J.C.: Bisimulations and logical characterizations on continuous-time Markov decision processes. In: McMillan, K.L., Rival, X. (eds.) VMCAI 2014. LNCS, vol. 8318, pp. 98\u2013117. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54013-4_6"},{"key":"8_CR54","doi-asserted-by":"publisher","unstructured":"Tognazzi, S., Tribastone, M., Tschaikowski, M., Vandin, A.: EGAC: a genetic algorithm to compare chemical reaction networks. In: Genetic and Evolutionary Computation Conference, GECCO, pp. 833\u2013840 (2017). https:\/\/doi.org\/10.1145\/3071178.3071265","DOI":"10.1145\/3071178.3071265"},{"key":"8_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-16561-0_12","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"M Tribastone","year":"2010","unstructured":"Tribastone, M., Mayer, P., Wirsing, M.: Performance prediction of service-oriented systems with layered queueing networks. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6416, pp. 51\u201365. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16561-0_12"},{"key":"8_CR56","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.08.016","volume":"517","author":"M Tschaikowski","year":"2014","unstructured":"Tschaikowski, M., Tribastone, M.: Tackling continuous state-space explosion in a Markovian process algebra. Theor. Comput. Sci. 517, 1\u201333 (2014). https:\/\/doi.org\/10.1016\/j.tcs.2013.08.016","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"8_CR57","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(4), 1099\u20131104 (2016). https:\/\/doi.org\/10.1109\/TAC.2015.2457172","journal-title":"IEEE Trans. Autom. Control"},{"key":"8_CR58","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.peva.2016.12.005","volume":"109","author":"M Tschaikowski","year":"2017","unstructured":"Tschaikowski, M., Tribastone, M.: Spatial fluid limits for stochastic mobile networks. J. Perform. Eval. 109, 52\u201376 (2017). https:\/\/doi.org\/10.1016\/j.peva.2016.12.005","journal-title":"J. Perform. Eval."},{"key":"8_CR59","doi-asserted-by":"publisher","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October\u20131 November 1989, pp. 332\u2013337. IEEE Computer Society (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63499","DOI":"10.1109\/SFCS.1989.63499"},{"key":"8_CR60","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/978-3-540-88479-8_13","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation","author":"M Wirsing","year":"2008","unstructured":"Wirsing, M., et al.: Sensoria patterns: augmenting service engineering with formal analysis, transformation and dynamicity. In: Margaria, T., Steffen, B. (eds.) ISoLA 2008. CCIS, vol. 17, pp. 170\u2013190. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88479-8_13"}],"container-title":["Lecture Notes in Computer Science","Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68416-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T10:28:32Z","timestamp":1732703312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68416-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031684159","9783031684166"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68416-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"QEST+FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Quantitative Evaluation of Systems and Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Calgary, AB","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","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":"10 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.qest-formats.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}