{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T03:47:07Z","timestamp":1775274427029,"version":"3.50.1"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046170","type":"print"},{"value":"9783030046187","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-04618-7_19","type":"book-chapter","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T15:47:58Z","timestamp":1542383278000},"page":"233-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Computation of Kullback-Leibler Divergence Between Labeled Stochastic Systems with Non-identical State Spaces"],"prefix":"10.1007","author":[{"given":"Krishnendu","family":"Ghosh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2013.12.002","volume":"297","author":"A Abate","year":"2013","unstructured":"Abate, A.: Approximation metrics based on probabilistic bisimulations for general state-space Markov processes: a survey. Electron. Notes Theor. Comput. Sci. 297, 3\u201325 (2013)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.jlamp.2018.05.006","volume":"100","author":"G Bacci","year":"2018","unstructured":"Bacci, G., Bacci, G., Larsen, K.G., Mardare, R.: On the metric-based approximate minimization of Markov Chains. J. Log. Algebraic Methods Program. 100, 36\u201356 (2018)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"19_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.P., Larsen, K.G.: Principles of Model Checking. MIT press, Cambridge (2008)"},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2011.12.058","volume":"431","author":"R Barbuti","year":"2012","unstructured":"Barbuti, R., Caravagna, G., Maggiolo-Schettini, A., Milazzo, P., Tini, S.: Foundational aspects of multiscale modeling of biological systems with process algebras. Theor. Comput. Sci. 431, 96\u2013116 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR5","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":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/3-540-36481-1_13","volume-title":"Computational Methods in Systems Biology","author":"N Chabrier","year":"2003","unstructured":"Chabrier, N., Fages, F.: Symbolic model checking of biochemical networks. In: Priami, C. (ed.) CMSB 2003. LNCS, vol. 2602, pp. 149\u2013162. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-36481-1_13"},{"key":"19_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/978-3-642-28729-9_29","volume-title":"Foundations of Software Science and Computational Structures","author":"D Chen","year":"2012","unstructured":"Chen, D., van Breugel, F., Worrell, J.: On the complexity of computing probabilistic bisimilarity. In: Birkedal, L. (ed.) FoSSaCS 2012. LNCS, vol. 7213, pp. 437\u2013451. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28729-9_29"},{"key":"19_CR8","volume-title":"Model Checking","author":"EM Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT press, Cambridge (1999)"},{"key":"19_CR9","unstructured":"Daca, P., Henzinger, T.A., Kretinsky, J., Petrov, T.: Linear distances between Markov Chains. In: Desharnais, J., Jagadeesan, R. (eds.) 27th International Conference on Concurrency Theory (CONCUR 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 59, pp. 20:1\u201320:15. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany (2016). http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2016\/6182"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Approximating labeled Markov processes. In: Proceedings of 15th Annual IEEE Symposium on Logic in Computer Science 2000, pp. 95\u2013106. IEEE (2000)","DOI":"10.1109\/LICS.2000.855759"},{"issue":"03","key":"19_CR11","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1142\/S0129054108005814","volume":"19","author":"L Doyen","year":"2008","unstructured":"Doyen, L., Henzinger, T.A., Raskin, J.F.: Equivalence of labeled Markov Chains. Int. J. Found. Comput. Sci. 19(03), 549\u2013563 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"19_CR12","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. Theor. Comput. Sci. 431, 137\u2013164 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-662-49630-5_18","volume-title":"Foundations of Software Science and Computation Structures","author":"N Fijalkow","year":"2016","unstructured":"Fijalkow, N., Kiefer, S., Shirmohammadi, M.: Trace refinement in labelled Markov decision processes. In: Jacobs, B., L\u00f6ding, C. (eds.) FoSSaCS 2016. LNCS, vol. 9634, pp. 303\u2013318. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49630-5_18"},{"issue":"3","key":"19_CR14","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.nancom.2015.05.002","volume":"6","author":"K Ghosh","year":"2015","unstructured":"Ghosh, K.: Computing equivalences on model abstractions representing multiscale processes. Nano Commun. Netw. 6(3), 118\u2013123 (2015)","journal-title":"Nano Commun. Netw."},{"issue":"05","key":"19_CR15","doi-asserted-by":"publisher","first-page":"1440002","DOI":"10.1142\/S0219720014400022","volume":"12","author":"K Ghosh","year":"2014","unstructured":"Ghosh, K., Schlipf, J.: Formal modeling of a system of chemical reactions under uncertainty. J. Bioinf. Comput. Biol. 12(05), 1440002 (2014)","journal-title":"J. Bioinf. Comput. Biol."},{"key":"19_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1007\/BFb0032063","volume-title":"Automata, Languages and Programming","author":"JF Groote","year":"1990","unstructured":"Groote, J.F., Vaandrager, F.: An efficient algorithm for branching bisimulation and stuttering equivalence. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 626\u2013638. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/BFb0032063"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/3060140","volume":"18","author":"JF Groote","year":"2017","unstructured":"Groote, J.F., Jansen, D.N., Keiren, J.J., Wijs, A.J.: An o (m log n) algorithm for computing stuttering equivalence and branching bisimulation. ACM Trans. Comput. Logic (TOCL) 18(2), 13 (2017)","journal-title":"ACM Trans. Comput. Logic (TOCL)"},{"issue":"1","key":"19_CR18","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"19_CR19","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."},{"issue":"4","key":"19_CR20","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1109\/TCBB.2017.2749225","volume":"15","author":"Loic Pauleve","year":"2018","unstructured":"Paulev\u00e9, L.: Reduction of qualitative models of biological networks for transient dynamics analysis. IEEE\/ACM Trans. Comput. Biol. Bioinf. 15, 1167\u20131179 (2017, in press)","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"issue":"18","key":"19_CR21","doi-asserted-by":"publisher","first-page":"3455","DOI":"10.1093\/bioinformatics\/bth426","volume":"20","author":"TD Pham","year":"2004","unstructured":"Pham, T.D., Zuegg, J.: A probabilistic measure for alignment-free sequence comparison. Bioinformatics 20(18), 3455\u20133461 (2004)","journal-title":"Bioinformatics"},{"key":"19_CR22","unstructured":"Shin, S.W., Thachuk, C., Winfree, E.: Verifying chemical reaction network implementations: a pathway decomposition approach. Theor. Comput. Sci. (2017)"},{"key":"19_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11538-017-0277-2","volume":"79","author":"TJ Snowden","year":"2017","unstructured":"Snowden, T.J., van der Graaf, P.H., Tindall, M.J.: Methods of model reduction for large-scale biological systems: a survey of current methods and trends. Bull. Math. Biol. 79, 1\u201338 (2017)","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"19_CR24","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1186\/1752-0509-4-28","volume":"4","author":"M Sunn\u00e5ker","year":"2010","unstructured":"Sunn\u00e5ker, M., Schmidt, H., Jirstrand, M., Cedersund, G.: Zooming of states and parameters using a lumping approach including back-translation. BMC Syst. Biol. 4(1), 28 (2010)","journal-title":"BMC Syst. Biol."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Thorsley, D., Klavins, E.: Model reduction of stochastic processes using wasserstein pseudometrics. In: 2008 American Control Conference, pp. 1374\u20131381. IEEE (2008)","DOI":"10.1109\/ACC.2008.4586684"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04618-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T02:51:45Z","timestamp":1775271105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04618-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046170","9783030046187"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04618-7_19","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":"17 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"3 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/aaim2018.wordpress.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}