Skip to content
cs-conference-ranking
.org
By subfield
By rank
Methodology
⌕
Search 971 venues
Home
/
LICS
/
Paper
The Finite Satisfiability Problem for PCTL is Undecidable.
Miroslav Chodil
,
Antonn Kucera
Venue
A*
LICS
Year
2024
Proceedings
LICS
DBLP record
conf/lics/Chodil024 ↗
Browse the full
LICS paper archive
.