Conference
The Finite Satisfiability Problem for PCTL is Undecidable
| Τίτλος: | The Finite Satisfiability Problem for PCTL is Undecidable |
|---|---|
| Συγγραφείς: | Chodil, Miroslav, Kučera, Antonín |
| Πηγή: | Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. :1-14 |
| Διαθεσιμότητα: | http://dl.acm.org/doi/10.1145/3661814.3662145 |
| Βάση Δεδομένων: | ACM Full-Text Collection |
| DOI: | 10.1145/3661814.3662145 |
|---|