"The General and Finite Satisfiability Problems for PCTL are Undecidable."

Miroslav Chodil, Antonín Kucera (2024)

Details and statistics

DOI: 10.48550/ARXIV.2404.10648

access: open

type: Informal or Other Publication

metadata version: 2024-05-15

a service of  Schloss Dagstuhl - Leibniz Center for Informatics