{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:08Z","timestamp":1740099068828,"version":"3.37.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319893655"},{"type":"electronic","value":"9783319893662"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-89366-2_22","type":"book-chapter","created":{"date-parts":[[2018,4,13]],"date-time":"2018-04-13T19:52:34Z","timestamp":1523649154000},"page":"403-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Symbolically Quantifying Response Time in Stochastic Models Using Moments and\u00a0Semirings"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Bazille","sequence":"first","affiliation":[]},{"given":"Eric","family":"Fabre","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5758-1876","authenticated-orcid":false,"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,14]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.ic.2015.03.003","volume":"241","author":"Eugene Asarin","year":"2015","unstructured":"Asarin, E., Basset, N., Degorre, A.: Entropy of regular timed languages. In: Information and Computation, vol. 241, pp. 142\u2013176. Elsevier (2015)","journal-title":"Information and Computation"},{"key":"22_CR2","unstructured":"Angrish, R., Chakraborty, S.: Probabilistic timing analysis of asynchronous systems with moments of delay. In: ASYNC 2002. IEEE (2002)"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Alur, R.: Formal analysis of hierarchical state machines. In: Verification: Theory and Practice, pp. 42\u201366 (2002)","DOI":"10.1007\/978-3-540-39910-0_3"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-319-45177-0_2","volume-title":"Computational Methods in Systems Biology","author":"M Backenk\u00f6hler","year":"2016","unstructured":"Backenk\u00f6hler, M., Bortolussi, L., Wolf, V.: Generalized method of moments for stochastic reaction networks in equilibrium. In: Bartocci, E., Lio, P., Paoletti, N. (eds.) CMSB 2016. LNCS, vol. 9859, pp. 15\u201329. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45177-0_2"},{"key":"22_CR5","unstructured":"Bazille, H., Fabre, E., Genest, B.; Symbolically quantifying response time in stochastic models using moments and semirings. https:\/\/perso.crans.org\/~genest\/BFG18.pdf"},{"key":"22_CR6","unstructured":"Bradley, J., Dingle, N., Harder, U., Harrison, P., Knottenbelt, W.: Response time densities and quantiles in large Markov and semi-Markov Models. In: Performance Evaluation of Parallel, Distributed and Emergent Systems, vol. 1 (2006)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-23401-4_8","volume-title":"Computational Methods in Systems Biology","author":"S Bogomolov","year":"2015","unstructured":"Bogomolov, S., Henzinger, T.A., Podelski, A., Ruess, J., Schilling, C.: Adaptive moment closure for parameter inference of biochemical reaction networks. In: Roux, O., Bourdon, J. (eds.) CMSB 2015. LNCS, vol. 9308, pp. 77\u201389. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23401-4_8"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-21254-3_17","volume-title":"Language and Automata Theory and Applications","author":"K Chatterjee","year":"2011","unstructured":"Chatterjee, K., Henzinger, T.A., Horn, F.: The complexity of request-response games. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 227\u2013237. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_17"},{"key":"22_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-68612-7","volume-title":"Introduction to Discrete Event Systems","author":"C Cassandras","year":"2007","unstructured":"Cassandras, C., Lafortune, S.: Introduction to Discrete Event Systems. Springer, Boston (2007). https:\/\/doi.org\/10.1007\/978-0-387-68612-7"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1142\/S0129054108005644","volume":"19","author":"C Cortes","year":"2006","unstructured":"Cortes, C., Mohri, M., Rastogi, A., Riley, M.: On the computation of the relative entropy of probabilistic automata. Int. J. Found. Comput. Sci. (IJFCS) 19(1), 219\u2013242 (2006)","journal-title":"Int. J. Found. Comput. Sci. (IJFCS)"},{"key":"22_CR11","volume-title":"Elements of Information Theory","author":"T Cover","year":"2006","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, New York (2006)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-540-31862-0_21","volume-title":"Theoretical Aspects of Computing - ICTAC 2004","author":"C Daws","year":"2005","unstructured":"Daws, C.: Symbolic and parametric model checking of discrete-time Markov chains. In: Liu, Z., Araki, K. (eds.) ICTAC 2004. LNCS, vol. 3407, pp. 280\u2013294. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31862-0_21"},{"issue":"2","key":"22_CR13","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1137\/S0895479804442462","volume":"27","author":"T Dayar","year":"2005","unstructured":"Dayar, T., Akar, N.: Computing moments of first passage times to a subset of states in Markov chains. SIAM J. Matrix Anal. Appl. 27(2), 396\u2013412 (2005)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Gonzalez, A.M., Uhlendorf, J., Schaul, J., Cinquemani, E., Batt, G., Ferrari-Trecate, G.: Identification of biological models from single-cell data: a comparison between mixed-effects and moment-based inference. In: ECC 2013, pp. 3652\u20133657. IEEE (2013)","DOI":"10.23919\/ECC.2013.6669366"},{"issue":"3","key":"22_CR15","first-page":"179","volume":"49","author":"F Horn","year":"2015","unstructured":"Horn, F., Thomas, W., Wallmeier, N., Zimmerman, M.: Optimal strategy synthesis for request-response games. RAIRO 49(3), 179\u2013203 (2015)","journal-title":"RAIRO"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-319-10696-0_31","volume-title":"Quantitative Evaluation of Systems","author":"N Jansen","year":"2014","unstructured":"Jansen, N., Corzilius, F., Volk, M., Wimmer, R., \u00c1brah\u00e1m, E., Katoen, J.-P., Becker, B.: Accelerating parametric probabilistic verification. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 404\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10696-0_31"},{"key":"22_CR17","volume-title":"Probability Theory, Basic Concepts $$\\cdot $$\u00b7 Limit Theorems Random Processes","author":"Y Prohorov","year":"1969","unstructured":"Prohorov, Y., Rozanov, Y.: Probability Theory, Basic Concepts $$\\cdot $$\u00b7 Limit Theorems Random Processes. Springer, Heidelberg (1969). Translated from Russian"},{"key":"22_CR18","unstructured":"Stoyanov, J.: Determinacy of distributions by their moments. In: ICMSM 2006 (2006)"},{"key":"22_CR19","unstructured":"Tari, \u00c1: Moments based bounds in stochastic models, Ph.D. Thesis. Budapesti M\u0171szaki \u00e9s Gazdas\u00e1gtudom\u00e1nyi Egyetem (2005)"},{"issue":"9\u201312","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1016\/j.peva.2007.06.001","volume":"64","author":"M Telek","year":"2007","unstructured":"Telek, M., Horv\u00e9th, G.: A minimal representation of Markov arrival processes and a moments matching method. Perform. Eval. 64(9\u201312), 1153\u20131168 (2007)","journal-title":"Perform. Eval."},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-45089-0_3","volume-title":"Implementation and Application of Automata","author":"Nico Wallmeier","year":"2003","unstructured":"Wallmeier, N., H\u00fctten, P., Thomas, W.: Symbolic synthesis of finite-state controllers for Request-Response specifications. In: CIAA 2003 (2003)"},{"issue":"4","key":"22_CR22","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/3213962","volume":"22","author":"D Yao","year":"1985","unstructured":"Yao, D.: First-passage-time moments of Markov processes. J. Appl. Probab. 22(4), 939\u2013945 (1985)","journal-title":"J. Appl. Probab."}],"container-title":["Lecture Notes in Computer Science","Foundations of Software Science and Computation Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-89366-2_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,15]],"date-time":"2019-10-15T16:22:52Z","timestamp":1571156572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-89366-2_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319893655","9783319893662"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-89366-2_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}