In this short paper, we introduce the robust semantics for LTL × MS≤ that incorporates signed Hausdorff distances to quantify the subset or equal, present a new definition for the Disconnected RCC predicate, and demonstrate the preliminary results of applying robustness-guided falsification in a traffic scenario setting.
Abstract
Published at: Inforum 2024
Conclusion
To the best of our knowledge, this work is the first application of robustness-guided falsification in the context of traffic scenarios. We have presented the
robust semantics for LTL × MS≤ and applied robustness-guided falsification to this fragment. As future work, we plan to improve the discontinuities given by
the robustness function, and to benchmark other optimization algorithms used in falsification, such as ant colony or genetic algorithms.
