The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL

Jan Kretínský, Alexej Rotar. The Satisfiability Problem for Unbounded Fragments of Probabilistic CTL. In Sven Schewe, Lijun Zhang 0001, editors, 29th International Conference on Concurrency Theory, CONCUR 2018, September 4-7, 2018, Beijing, China. Volume 118 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]

Abstract

Abstract is missing.