Counterexample-Guided Interval Weakening
Ben M. Andrew, Louise A. Dennis, Michael Fisher, Marie Farrell

TL;DR
CEGIW is an iterative algorithm that automatically weakens timing intervals in Metric Temporal Logic specifications to ensure they hold in degraded system models, maintaining logical structure and optimal bounds.
Contribution
This paper introduces CEGIW, a novel counterexample-guided method for automatically weakening MTL timing intervals while preserving specification structure and proving correctness.
Findings
CEGIW successfully weakens timing bounds in real-world case studies.
The algorithm guarantees the weakest interval bounds that satisfy the system model.
Empirical results demonstrate CEGIW's practicality and effectiveness.
Abstract
Systems deployed for long periods of time in dynamic environments may experience performance degradation that affects timing guarantees, even when their functional behaviour remains unchanged. In the design and verification of critical systems, such timing guarantees are often expressed using Metric Temporal Logic (MTL). Under degradation, these specifications may no longer hold as stated, although weaker variants that relax timing bounds may still be satisfied and remain meaningful. For example, while an elevator may initially be required to arrive within 30 seconds of a request, degradation of its motor may only allow us to guarantee arrival within 60 seconds. Although weaker, this guarantee is still useful and allows the system to maintain a reasonable level of operation. In this paper we present CEGIW, an iterative, counterexample-guided algorithm for automatically weakening timing…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
