Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1784098, author = {Chodil, Miroslav and Kučera, Antonín}, address = {Německo}, booktitle = {Fundamentals of Computation Theory. 23rd International Symposium, FCT 2021}, doi = {http://dx.doi.org/10.1007/978-3-030-86593-1_10}, editor = {Evripidis Bampis and Aris Pagourtzis}, keywords = {Probabilistic temporal logic; satisfiability}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Německo}, isbn = {978-3-030-86592-4}, pages = {149-161}, publisher = {Springer}, title = {The Satisfiability Problem for a Quantitative Fragment of PCTL}, year = {2021} }
TY - JOUR ID - 1784098 AU - Chodil, Miroslav - Kučera, Antonín PY - 2021 TI - The Satisfiability Problem for a Quantitative Fragment of PCTL PB - Springer CY - Německo SN - 9783030865924 KW - Probabilistic temporal logic KW - satisfiability N2 - We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in 2-EXPSPACE). The condition is semantic and it is based on enforcing a form of ``progress'' in non-bottom SCCs contributing to the satisfaction of a given PCTL formula. We show that the condition is satisfied by PCTL fragments beyond the reach of existing methods. ER -
CHODIL, Miroslav a Antonín KUČERA. The Satisfiability Problem for a Quantitative Fragment of PCTL. In Evripidis Bampis and Aris Pagourtzis. \textit{Fundamentals of Computation Theory. 23rd International Symposium, FCT 2021}. Německo: Springer, 2021, s.~149-161. ISBN~978-3-030-86592-4. Dostupné z: https://dx.doi.org/10.1007/978-3-030-86593-1\_{}10.
|