collaborators

1 paper

cs.LO2025

The Satisfiability and Validity Problems for Probabilistic Computational Tree Logic are Highly Undecidable

Miroslav Chodil, Antonín Kučera

The Probabilistic Computational Tree Logic (PCTL) is the main specification formalism for discrete probabilistic systems modeled by Markov chains. Despite serious research attempts…