A Verified Proof Checker for Metric First-Order Temporal Logic

This is a development version of this entry. It might change over time and is not stable. Please refer to release versions for citations.

Abstract

Metric first-order temporal logic (MFOTL) is an expressive formalism for specifying temporal and data-dependent constraints on streams of time-stamped, data-carrying events. Recently, we have developed a monitoring algorithm that not only outputs the satisfaction or violation of MFOTL formulas but also explains its verdicts in the form of proof trees. These explanations serve as certificates, and in this entry we verify the correctness of a certificate checker. The checker is used to certify the output of our new, unverified monitoring tool WhyMon. The formalization contains another unverified, executable implementation of an explanation-producing monitoring algorithm used to exemplify our checker.

License

BSD License

Topics

Related publications

Lima, L., Huerta y Munive, J. J., & Traytel, D. (2024). Explainable Online Monitoring of Metric First-Order Temporal Logic. Tools and Algorithms for the Construction and Analysis of Systems, 288–307. https://doi.org/10.1007/978-3-031-57246-3_16
Lima, L., Herasimau, A., Raszyk, M., Traytel, D., & Yuan, S. (2023). Explainable Online Monitoring of Metric Temporal Logic. Tools and Algorithms for the Construction and Analysis of Systems, 473–491. https://doi.org/10.1007/978-3-031-30820-8_28

Session MFOTL_Checker

Depends on

Formalization of a Monitoring Algorithm for Metric First-Order Temporal Logic