CHODIL, Miroslav, Antonín KUČERA and Jan KŘETÍNSKÝ. Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge. In Jean-Francois Raskin, Krishnendu Chatterjee, Laurent Doyen, and Rupak Majumdar. Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday. New York, NY, United States: Springer, 2022, p. 364-387. ISBN 978-3-031-22336-5. Available from: https://dx.doi.org/10.1007/978-3-031-22337-2_18.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge
Authors CHODIL, Miroslav (703 Slovakia, belonging to the institution), Antonín KUČERA (203 Czech Republic, guarantor, belonging to the institution) and Jan KŘETÍNSKÝ (203 Czech Republic, belonging to the institution).
Edition New York, NY, United States, Principles of Systems Design - Essays Dedicated to Thomas A. Henzinger on the Occasion of His 60th Birthday, p. 364-387, 24 pp. 2022.
Publisher Springer
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 10201 Computer sciences, information science, bioinformatics
Country of publisher United States of America
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
WWW The book URL.
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/22:00127926
Organization unit Faculty of Informatics
ISBN 978-3-031-22336-5
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-031-22337-2_18
Keywords in English probabilistic logics; satisfiablity
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 6/4/2023 06:35.
Abstract
The decidability of PCTL satisfiability is a challenging open problem in logic and formal verification. We give an overview of the existing results and proof techniques, and we also present some new results documenting the subtlety of the problem.
Links
GA21-24711S, research and development projectName: Efektivní analýza a optimalizace pravděpodobnostních systémů a her (Acronym: Efektivní analýza a optimalizace pravděpodobnostní)
Investor: Czech Science Foundation
MUNI/A/1145/2021, interní kód MUName: Rozsáhlé výpočetní systémy: modely, aplikace a verifikace XI. (Acronym: SV-FI MAV XI.)
Investor: Masaryk University
PrintDisplayed: 19/7/2024 01:42