REFERENCES
1. Bai, Y.; Kadavath, S.; Kundu, K.; et al. Constitutional AI: harmlessness from AI feedback. arXiv 2022, arXiv:2212.08073. Available online: https://doi.org/10.48550/arXiv.2212.08073 (accessed 28 September 2026).
2. Valmeekam, K.; Marquez, M.; Sreedharan, S.; Kambhampati, S. On the planning abilities of large language models - a critical investigation. arXiv 2023, arXiv:2305.15771. Available online: https://doi.org/10.48550/arXiv.2305.15771 (accessed 28 September 2026).
3. Lewis, P.; Perez, E.; Piktus, A.; et al. Retrieval-augmented generation for knowledge-intensive NLP tasks. arXiv 2020, arXiv:2005.11401. Available online: https://doi.org/10.48550/arXiv.2005.11401 (accessed 28 September 2026).
4. Leucker, M.; Schallhart, C. A brief account of runtime verification. J. Log. Algebr. Methods Program. 2009, 78, 293-303.
5. Havelund, K.; Roşu, G. Synthesizing monitors for safety properties. In Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2002. Katoen, J. P., Stevens, P., Eds.; Springer: Berlin, Germany, 2002; Vol. 2280, pp. 342-56.
6. Kamath A, Zhang S, Xu C, et al. Enforcing temporal constraints for LLM agents. arXiv 2025, arXiv:2512.23738. Available online: https://doi.org/10.48550/arXiv.2512.23738 (accessed 28 September 2026).
7. Zhang, Y.; Emma, S. Y.; En, A. L. J.; Dong, J. S. RvLLM: LLM runtime verification with domain knowledge. arXiv 2025, arXiv:2505.18585. Available online: https://doi.org/10.48550/arXiv.2505.18585 (accessed 28 September 2026).
8. Liu, B.; Jiang, Y.; Zhang, X.; et al. LLM+P: Empowering large language models with optimal planning proficiency. arXiv 2023, arXiv:2304.11477. Available online: https://doi.org/10.48550/arXiv.2304.11477 (accessed 28 September 2026).
9. Kambhampati, S.; Valmeekam, K.; Guan, L.; et al. LLMs can’t plan, but can help planning in LLM-modulo frameworks. arXiv 2024, arXiv:2402.01817. Available online: https://doi.org/10.48550/arXiv.2402.01817 (accessed 28 September 2026).
10. Ji, Z.; Lee, N.; Frieske, R.; et al. Survey of hallucination in natural language generation. ACM Comput. Surv. 2023, 55, 1-38.
11. Pnueli, A. The temporal logic of programs. In 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), Providence, RI, USA, October 31-November 1 1977; IEEE, 1977; pp. 46-57.
12. De Giacomo, G.; Vardi, M. Y. Linear temporal and dynamic logic on finite traces. In Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, 2013; pp. 854-60. Available from: https://www.ijcai.org/Proceedings/13/Papers/132.pdf. (accessed 2026-09-28).
13. Fuggitti, F. LTLf2DFA [software]. Version 1.0.0.post0. Zenodo; 2019. Available from: https://zenodo.org/records/3888410. (Source code: https://github.com/whitemech/LTLf2DFA). (accessed 2026-09-28).
14. Rothkopf R, Zeng HT, Santolucito M. Enforcing temporal constraints on generative agent behavior with reactive synthesis. arXiv 2024, arXiv:2402.16905. Available online: https://doi.org/10.48550/arXiv.2402.16905 (accessed 28 September 2026).
15. Karpathy, A. LLM Wiki. GitHub gist; 6 Apr 2026. Available from: https://gist.github.com/karpathy/442a6bf555914893e9891c11519de94f. (accessed 2026-09-28).
16. Team, G. L. M.; Zeng, A.; Xu, B.; et al. ChatGLM: a family of large language models from GLM-130B to GLM-4 all tools. arXiv 2024, arXiv:2406.12793. Available online: https://doi.org/10.48550/arXiv.2406.12793 (accessed 28 September 2026).
17. Wang, L.; Ma, C.; Feng, X.; et al. A survey on large language model based autonomous agents. Front. Comput. Sci. 2024, 18, 186345.
