Παραπομπή σε μορφή APA (7η εκδ.)

Chodil, M., & Kučera, A. (2024). The Finite Satisfiability Problem for PCTL is Undecidable. Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 1. https://doi.org/10.1145/3661814.3662145

Παραπομπή σε μορφή Chicago (17η εκδ.)

Chodil, Miroslav, και Antonín Kučera. "The Finite Satisfiability Problem for PCTL Is Undecidable." Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science 2024: 1. https://doi.org/10.1145/3661814.3662145.

Παραπομπή σε μορφή MLA (9th εκδ.)

Chodil, Miroslav, και Antonín Kučera. "The Finite Satisfiability Problem for PCTL Is Undecidable." Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024, p. 1, https://doi.org/10.1145/3661814.3662145.