{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:30:59Z","timestamp":1759336259715,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031452857"},{"type":"electronic","value":"9783031452864"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-45286-4_10","type":"book-chapter","created":{"date-parts":[[2023,10,4]],"date-time":"2023-10-04T09:02:28Z","timestamp":1696410148000},"page":"127-140","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Introducing Divergence for\u00a0Infinite Probabilistic Models"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2482-6141","authenticated-orcid":false,"given":"Alain","family":"Finkel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1759-1201","authenticated-orcid":false,"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2217-4752","authenticated-orcid":false,"given":"Lina","family":"Ye","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,5]]},"reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.ic.2005.05.008","volume":"202","author":"PA Abdulla","year":"2005","unstructured":"Abdulla, P.A., Bertrand, N., Rabinovich, A.M., Schnoebelen, P.: Verification of probabilistic systems with faulty communication. Inf. Comput. 202(2), 141\u2013165 (2005)","journal-title":"Inf. Comput."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R.: Decisive Markov chains. Log. Methods Comput. Sci. 3(4) (2007)","DOI":"10.2168\/LMCS-3(4:7)2007"},{"key":"10_CR3","volume-title":"Principles of Model Checking","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.: Principles of Model Checking. MIT Press, Heidelberg (2008)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Chatterjee, K., Kucera, A., Novotn\u00fd, P., Velan, D., Zuleger, F.: Efficient algorithms for asymptotic bounds on termination time in VASS. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of the 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, LICS 2018, pp. 185\u2013194. ACM (2018)","DOI":"10.1145\/3209108.3209191"},{"issue":"2","key":"10_CR5","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/s10703-012-0166-0","volume":"43","author":"T Br\u00e1zdil","year":"2013","unstructured":"Br\u00e1zdil, T., Esparza, J., Kiefer, S., Kucera, A.: Analyzing probabilistic pushdown automata. Formal Methods Syst. Des. 43(2), 124\u2013163 (2013)","journal-title":"Formal Methods Syst. Des."},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Esparza, J., Kucera, A.: Analysis and prediction of the long-run behavior of probabilistic sequential programs with recursion (extended abstract). In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 521\u2013530. IEEE Computer Society (2005)","DOI":"10.1109\/SFCS.2005.19"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-22110-1_18","volume-title":"Computer Aided Verification","author":"T Br\u00e1zdil","year":"2011","unstructured":"Br\u00e1zdil, T., Kiefer, S., Ku\u010dera, A.: Efficient analysis of probabilistic programs with an unbounded counter. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 208\u2013224. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_18"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Kiefer, S., Kucera, A.: Efficient analysis of probabilistic programs with an unbounded counter. J. ACM 61(6), 41:1\u201341:35 (2014)","DOI":"10.1145\/2629599"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Br\u00e1zdil, T., Kiefer, S., Kucera, A., Novotn\u00fd, P., Katoen, J.: Zero-reachability in probabilistic multi-counter automata. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS 2014, pp. 22:1\u201322:10. ACM (2014)","DOI":"10.1145\/2603088.2603161"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. In: Proceedings of 19th IEEE Symposium on Logic in Computer Science (LICS), pp. 12\u201321. IEEE Computer Society (2004)","DOI":"10.1109\/LICS.2004.1319596"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kucera, A., Mayr, R.: Quantitative analysis of probabilistic pushdown automata: expectations and variances. In: Proceedings of the 20th IEEE Symposium on Logic in Computer Science (LICS), pp. 117\u2013126. IEEE Computer Society (2005)","DOI":"10.1109\/LICS.2005.39"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Esparza, J., Kucera, A., Mayr, R.: Model checking probabilistic pushdown automata. Logical Methods Comput. Sci. 2(1) (2006)","DOI":"10.2168\/LMCS-2(1:2)2006"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Finkel, A., Haddad, S., Ye, L.: About decisiveness of dynamic probabilistic models. CoRR abs\/2305.19564 (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.19564, to appear in CONCUR\u201923","DOI":"10.48550\/arXiv.2305.19564"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Finkel, A., Haddad, S., Ye, L.: Introducing divergence for infinite probabilistic models. CoRR abs\/2308.08842 (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.08842","DOI":"10.48550\/arXiv.2308.08842"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/BFb0030633","volume-title":"TAPSOFT \u201997: Theory and Practice of Software Development","author":"P Iyer","year":"1997","unstructured":"Iyer, P., Narasimha, M.: Probabilistic lossy channel systems. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997. LNCS, vol. 1214, pp. 667\u2013681. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0030633"},{"key":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-9455-6","volume-title":"Denumerable Markov Chains","author":"J Kemeny","year":"1976","unstructured":"Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains, 2nd edn. Springer, Heidelberg (1976). https:\/\/doi.org\/10.1007\/978-1-4684-9455-6","edition":"2"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Kucera, A., Esparza, J., Mayr, R.: Model checking probabilistic pushdown automata. Log. Methods Comput. Sci. 2(1) (2006). https:\/\/doi.org\/10.2168\/LMCS-2(1:2)2006","DOI":"10.2168\/LMCS-2(1:2)2006"},{"issue":"1","key":"10_CR18","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0019-9958(72)90026-5","volume":"21","author":"ES Santos","year":"1972","unstructured":"Santos, E.S.: Probabilistic grammars and automata. Inf. Control. 21(1), 27\u201347 (1972). https:\/\/doi.org\/10.1016\/S0019-9958(72)90026-5","journal-title":"Inf. Control."},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Automatic verification of probabilistic concurrent finite-state programs. In: Proceedings of the 26th Annual Symposium on Foundations of Computer Science, pp. 327\u2013338. IEEE Computer Society (1985)","DOI":"10.1109\/SFCS.1985.12"}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45286-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T00:05:35Z","timestamp":1730246735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45286-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031452857","9783031452864"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45286-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"5 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lix.polytechnique.fr\/Labo\/Olivier.Bournez\/RP2023\/i.php?n=Main.Home","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"68% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}