Conference
The Finite Satisfiability Problem for PCTL is Undecidable
| Title: | The Finite Satisfiability Problem for PCTL is Undecidable |
|---|---|
| Authors: | Chodil, Miroslav, Kučera, Antonín |
| Source: | Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science. :1-14 |
| Availability: | http://dl.acm.org/doi/10.1145/3661814.3662145 |
| Database: | ACM Full-Text Collection |
Be the first to leave a comment!