STL to SMT-LIB compiler based on definitions from "A Truly Robust Signal Temporal Logic: Monitoring Safety Properties of Interacting Cyber-Physical Systems under Uncertain Observation"
We finally add one of the two conjuncts
(a) ¬φ_t′ or
(b) φ_t′ alternatively,
where t′ = t − duration(φ), to the resultant constraint system and check both variants for their satisfiability using an SMT-LA solver.
Depending on the results of the two satisfiability checks, we report inconclusive if both systems are found to be satisfiable, ⊤ if the system (a) containing ¬φ_t′ is unsatisfiable, ⊥ if the system (b) containing φ_t′ is unsatisfiable.
We finally add one of the two conjuncts (a) ¬φ_t′ or (b) φ_t′ alternatively, where t′ = t − duration(φ), to the resultant constraint system and check both variants for their satisfiability using an SMT-LA solver. Depending on the results of the two satisfiability checks, we report inconclusive if both systems are found to be satisfiable, ⊤ if the system (a) containing ¬φ_t′ is unsatisfiable, ⊥ if the system (b) containing φ_t′ is unsatisfiable.