{"page":"337 - 352","day":"01","year":"2009","_id":"4453","quality_controlled":0,"doi":"10.1007/978-3-642-02658-4_27","alternative_title":["LNCS"],"intvolume":"      5643","file_date_updated":"2020-07-14T12:46:30Z","pubrep_id":"40","author":[{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Thomas Henzinger"},{"full_name":"Maria Mateescu","first_name":"Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","last_name":"Mateescu"},{"full_name":"Wolf, Verena","last_name":"Wolf","first_name":"Verena"}],"date_created":"2018-12-11T12:08:55Z","date_updated":"2021-01-12T07:57:04Z","title":"Sliding-window abstraction for infinite Markov chains","status":"public","oa":1,"abstract":[{"lang":"eng","text":"We present an on-the-fly abstraction technique for infinite-state continuous -time Markov chains. We consider Markov chains that are specified by a finite set of transition classes. Such models naturally represent biochemical reactions and therefore play an important role in the stochastic modeling of biological systems. We approximate the transient probability distributions at various time instances by solving a sequence of dynamically constructed abstract models, each depending on the previous one. Each abstract model is a finite Markov chain that represents the behavior of the original, infinite chain during a specific time interval. Our approach provides complete information about probability distributions, not just about individual parameters like the mean. The error of each abstraction can be computed, and the precision of the abstraction refined when desired. We implemented the algorithm and demonstrate its usefulness and efficiency on several case studies from systems biology."}],"conference":{"name":"CAV: Computer Aided Verification"},"acknowledgement":"The research has been partially funded by the Swiss National Science Foundation under grant 205321-111840.","date_published":"2009-01-01T00:00:00Z","type":"conference","publist_id":"278","publication_status":"published","volume":5643,"file":[{"file_id":"4938","access_level":"open_access","date_updated":"2020-07-14T12:46:30Z","file_size":804295,"date_created":"2018-12-12T10:12:20Z","creator":"system","checksum":"36b974111521ea534aae294166e93a63","file_name":"IST-2012-40-v1+1_Sliding-window_abstraction_for_infinite_markov_chains.pdf","relation":"main_file","content_type":"application/pdf"}],"extern":1,"main_file_link":[{"url":"http://pub.ist.ac.at/%7Etah/Publications/sliding-window_abstraction_for_infinite_markov_chains.pdf","open_access":"0"}],"month":"01","citation":{"apa":"Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2009). Sliding-window abstraction for infinite Markov chains (Vol. 5643, pp. 337–352). Presented at the CAV: Computer Aided Verification, Springer. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>","ama":"Henzinger TA, Mateescu M, Wolf V. Sliding-window abstraction for infinite Markov chains. In: Vol 5643. Springer; 2009:337-352. doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>","chicago":"Henzinger, Thomas A, Maria Mateescu, and Verena Wolf. “Sliding-Window Abstraction for Infinite Markov Chains,” 5643:337–52. Springer, 2009. <a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">https://doi.org/10.1007/978-3-642-02658-4_27</a>.","short":"T.A. Henzinger, M. Mateescu, V. Wolf, in:, Springer, 2009, pp. 337–352.","ieee":"T. A. Henzinger, M. Mateescu, and V. Wolf, “Sliding-window abstraction for infinite Markov chains,” presented at the CAV: Computer Aided Verification, 2009, vol. 5643, pp. 337–352.","ista":"Henzinger TA, Mateescu M, Wolf V. 2009. Sliding-window abstraction for infinite Markov chains. CAV: Computer Aided Verification, LNCS, vol. 5643, 337–352.","mla":"Henzinger, Thomas A., et al. <i>Sliding-Window Abstraction for Infinite Markov Chains</i>. Vol. 5643, Springer, 2009, pp. 337–52, doi:<a href=\"https://doi.org/10.1007/978-3-642-02658-4_27\">10.1007/978-3-642-02658-4_27</a>."},"publisher":"Springer"}