Finite-trace linear temporal logic: coinductive completeness

Linear temporal logic (LTL) is suitable not only for infinite-trace systems, but also for finite-trace systems. Indeed, LTL is frequently used as a trace specification formalism in runtime verification. The completeness of LTL with only infinite or with both infinite and finite traces has been extensively studied, but similar direct results for LTL with only finite traces are missing. This paper proposes a sound and complete proof system for finite-trace LTL. The axioms and proof rules are natural and expected, except for one rule of coinductive nature, reminiscent of the Godel-Lob axiom. A direct decision procedure for finite-trace LTL satisfiability, a PSPACE-complete problem, is also obtained as a corollary.

[1]  Amir Pnueli,et al.  The Glory of the Past , 1985, Logic of Programs.

[2]  Johan Anthory Willem Kamp,et al.  Tense logic and the theory of linear order , 1968 .

[3]  Igor Walukiewicz,et al.  An expressively complete linear time temporal logic for Mazurkiewicz traces , 1997, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science.

[4]  Marcelo d'Amorim,et al.  Efficient Monitoring of omega-Languages , 2005, CAV.

[5]  Amir Pnueli,et al.  Propositional Temporal Logics: Decidability and Completeness , 2000, Log. J. IGPL.

[6]  Jan A. Bergstra,et al.  Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems , 1983, SIAM J. Comput..

[7]  C. Pollard,et al.  Center for the Study of Language and Information , 2022 .

[8]  C. A. R. Hoare,et al.  An axiomatic basis for computer programming , 1969, CACM.

[9]  Grigore Rosu,et al.  Checking reachability using matching logic , 2012, OOPSLA '12.

[10]  V. Svejdar.  On provability logic , 1999 .

[11]  Martin Leucker,et al.  Comparing LTL Semantics for Runtime Verification , 2010, J. Log. Comput..

[12]  R. Goldblatt.  Logics of Time and Computation , 1987 .

[13]  Grigore Rosu,et al.  Rewriting-Based Techniques for Runtime Verification , 2005, Automated Software Engineering.

[14]  Martin Sulzmann,et al.  Constructive Finite Trace Analysis with Linear Temporal Logic , 2012, TAP@TOOLS.

[15]  Mahesh Viswanathan,et al.  Runtime Assurance Based On Formal Specifications , 1999, PDPTA.

[16]  Grigore Rosu,et al.  All-Path Reachability Logic , 2014, RTA-TLCA.

[17]  Thierry Jéron,et al.  On-Line Model Checking for Finite Linear Temporal Logic Specifications , 1989, Automatic Verification Methods for Finite State Systems.

[18]  Fred Kröger,et al.  Temporal Logic of Programs , 1987, EATCS Monographs on Theoretical Computer Science.

[19]  Dimitra Giannakopoulou,et al.  Automata-based verification of temporal properties on running programs , 2001, Proceedings 16th Annual International Conference on Automated Software Engineering (ASE 2001).

[20]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[21]  Grigore Rosu,et al.  One-Path Reachability Logic , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[22]  Grigore Rosu,et al.  Efficient monitoring of safety properties , 2004, International Journal on Software Tools for Technology Transfer.

[23]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[24]  Robert Goldblatt,et al.  Mathematical modal logic: A view of its evolution , 2003, J. Appl. Log..

[25]  Paul Gastin,et al.  LTL Is Expressively Complete for Mazurkiewicz Traces , 2000, J. Comput. Syst. Sci..