Computation Tree Logic
Computation Tree Logic (CTL) is a formal system for specifying and verifying properties of branching-time systems, finding applications in diverse fields like planning and verification of AI systems. Current research emphasizes extending CTL's capabilities, including incorporating probabilistic reasoning (probabilistic CTL or pCTL), integrating it with reinforcement learning for policy verification, and developing methods to improve the explainability and usability of CTL-based tools, particularly for non-experts. These advancements are driving progress in areas such as automated theorem proving, model checking of complex systems, and the development of more robust and trustworthy AI agents.
Papers
October 30, 2024
July 15, 2024
April 10, 2024
March 27, 2024
November 20, 2023
October 3, 2023
March 20, 2023
February 26, 2023
November 7, 2022
April 6, 2022