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

Miroslav Chodil, Antonn Kucera

Browse the full ICALP paper archive.