{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:28:26Z","timestamp":1759336106470,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032057914","type":"print"},{"value":"9783032057921","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T00:00:00Z","timestamp":1759363200000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-05792-1_13","type":"book-chapter","created":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T10:31:49Z","timestamp":1759314709000},"page":"237-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tightening the\u00a0Frontier of\u00a0Decidability for\u00a0Decisiveness"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-8357-5340","authenticated-orcid":false,"given":"Gaspard","family":"Fougea","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1759-1201","authenticated-orcid":false,"given":"Serge","family":"Haddad","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2217-4752","authenticated-orcid":false,"given":"Lina","family":"Ye","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1613-1615","authenticated-orcid":false,"given":"Shreyas","family":"Jain","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2482-6141","authenticated-orcid":false,"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,10,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","unstructured":"Abdulla, P.A., Henda, N.B., Mayr, R.: Decisive Markov chains. Log. Methods Comput. Sci. 3(4) (2007). https:\/\/doi.org\/10.2168\/LMCS-3(4:7)2007","DOI":"10.2168\/LMCS-3(4:7)2007"},{"key":"13_CR2","unstructured":"Baier, C., Katoen, J.: Principles of model checking. MIT Press (2008)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/J.PEVA.2015.04.003","volume":"90","author":"P Ballarini","year":"2015","unstructured":"Ballarini, P., Barbot, B., Duflot, M., Haddad, S., Pekergin, N.: HASL: a new approach for performance evaluation and model checking from concepts to experimentation. Perform. Eval. 90, 53\u201377 (2015). https:\/\/doi.org\/10.1016\/J.PEVA.2015.04.003","journal-title":"Perform. Eval."},{"key":"13_CR4","doi-asserted-by":"publisher","unstructured":"Beno\u00eet\u00a0Barbot, Patricia\u00a0Bouyer, S.H.: Beyond decisiveness of infinite Markov chains. In: FSTTCS 2024, pp. 8:1\u20138:22 (2024). https:\/\/doi.org\/10.4230\/LIPICS.FSTTCS.2024.8","DOI":"10.4230\/LIPICS.FSTTCS.2024.8"},{"issue":"2","key":"13_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). https:\/\/doi.org\/10.1007\/S10703-012-0166-0","journal-title":"Formal Methods Syst. Des."},{"key":"13_CR6","doi-asserted-by":"publisher","unstructured":"Finkel, A., Haddad, S., Ye, L.: About decisiveness of dynamic probabilistic models. In: P\u00e9rez, G.A., Raskin, J. (eds.) 34th International Conference on Concurrency Theory, CONCUR 2023, 18\u201323 September 2023, Antwerp, Belgium. LIPIcs, vol.\u00a0279, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.CONCUR.2023.14","DOI":"10.4230\/LIPICS.CONCUR.2023.14"},{"key":"13_CR7","doi-asserted-by":"publisher","unstructured":"Finkel, A., Haddad, S., Ye, L.: About decisiveness of dynamic probabilistic models. CoRR (2023). https:\/\/doi.org\/10.48550\/ARXIV.2305.19564","DOI":"10.48550\/ARXIV.2305.19564"},{"key":"13_CR8","doi-asserted-by":"publisher","unstructured":"Finkel, A., Haddad, S., Ye, L.: Introducing divergence for infinite probabilistic models. In: Bournez, O., Formenti, E., Potapov, I. (eds.) Reachability Problems - 17th International Conference, RP 2023, Nice, France, 11\u201313 October 2023, Proceedings. Lecture Notes in Computer Science, vol. 14235, pp. 127\u2013140. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-45286-4_10","DOI":"10.1007\/978-3-031-45286-4_10"},{"key":"13_CR9","doi-asserted-by":"publisher","unstructured":"Iyer, S.P., Narasimha, M.: Probabilistic lossy channel systems. In: Theory and Practice of Software Development (TAPSOFT), 7th International Joint Conference CAAP\/FASE. LNCS, vol.\u00a01214, pp. 667\u2013681. Springer (1997). https:\/\/doi.org\/10.1007\/BFB0030633","DOI":"10.1007\/BFB0030633"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Kemeny, J., Snell, J., Knapp, A.: Denumerable Markov Chains, 2nd edn. Springer (1976)","DOI":"10.1007\/978-1-4684-9455-6"},{"key":"13_CR11","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"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1080\/15326349808807481","volume":"14","author":"G Latouche","year":"1998","unstructured":"Latouche, G., Pearce, C.E.M., Taylor, P.G.: Invariant measures for quasi-birth-and-death processes. Commun. Stat. Stochast. Models 14, 443\u2013460 (1998). https:\/\/doi.org\/10.1080\/15326349808807481","journal-title":"Commun. Stat. Stochast. Models"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1007\/3-540-45061-0_78","volume-title":"Automata, Languages and Programming","author":"A Rabinovich","year":"2003","unstructured":"Rabinovich, A.: Quantitative analysis of probabilistic lossy channel systems. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1008\u20131021. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_78"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Rutten, J.J.M.M., Kwiatkowska, M.Z., Norman, G., Parker, D., Panangaden, P.: Mathematical techniques for analyzing concurrent and probabilistic systems, CRM Monograph Series, vol.\u00a023. American Mathematical Society (2004)","DOI":"10.1090\/crmm\/023"}],"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-032-05792-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T10:31:52Z","timestamp":1759314712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-05792-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,2]]},"ISBN":["9783032057914","9783032057921"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-05792-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,2]]},"assertion":[{"value":"2 October 2025","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":"Aarhus","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"qest2025","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"}}]}}