Počet publikací: 3
Články
-
The Finite Satisfiability Problem for PCTL is Undecidable
JOURNAL OF THE ACM, rok: 2026, ročník: 73, vydání: 1, DOI
Články ve sbornících
-
On Complementation of Nondeterministic Finite Automata Without Full Determinization
Fundamentals of Computation Theory - 25th International Symposium, FCT 2025, Wrocław, Poland, September 15-17, 2025, Proceedings, rok: 2026, DOI
-
PCTL Satisfiability for Infinite Binary Trees
Principles of Formal Quantitative Analysis : Essays Dedicated to Christel Baier on the Occasion of Her 60th Birthday, rok: 2026, DOI