"The Finite Satisfiability Problem for PCTL is Undecidable."

Miroslav Chodil, Antonín Kucera (2024)

Details and statistics

DOI: 10.1145/3661814.3662145

access: closed

type: Conference or Workshop Paper

metadata version: 2024-07-04

a service of  Schloss Dagstuhl - Leibniz Center for Informatics