Score: 2

pacSTL: PAC-Bounded Signal Temporal Logic from Data-Driven Reachability Analysis

Published: November 2, 2025 | arXiv ID: 2511.00934v1

By: Elizabeth Dietrich , Hanna Krasowski , Emir Cem Gezer and more

BigTech Affiliations: University of California, Berkeley

Potential Business Impact:

Helps robots stay safe when they aren't sure.

Business Areas:
Simulation Software

Real-world robotic systems must comply with safety requirements in the presence of uncertainty. To define and measure requirement adherence, Signal Temporal Logic (STL) offers a mathematically rigorous and expressive language. However, standard STL cannot account for uncertainty. We address this problem by presenting pacSTL, a framework that combines Probably Approximately Correct (PAC) bounded set predictions with an interval extension of STL through optimization problems on the atomic proposition level. pacSTL provides PAC-bounded robustness intervals on the specification level that can be utilized in monitoring. We demonstrate the effectiveness of this approach through maritime navigation and analyze the efficiency and scalability of pacSTL through simulation and real-world experimentation on model vessels.

Country of Origin
🇳🇴 🇺🇸 Norway, United States

Page Count
16 pages

Category
Computer Science:
Logic in Computer Science