Search Results for author:
Found 6 papers, 3 papers with code
Guaranteed Completion of Complex Tasks via Temporal Logic Trees and Hamilton-Jacobi Reachability
By ensuring a temporal logic tree has no leaking corners, we know the temporal logic tree correctly verifies the existence of control policies that satisfy the specified task.
Formal Verification of Linear Temporal Logic Specifications Using Hybrid Zonotope-Based Reachability Analysis
In this paper, we introduce a hybrid zonotope-based approach for formally verifying the behavior of autonomous systems operating under Linear Temporal Logic (LTL) specifications.
Formal Verification with Constrained Polynomial Logical Zonotope
To address this, we formulate constrained polynomial logical zonotopes, which maintain the computational efficiency and exactness of polynomial logical zonotopes for reachability analysis while supporting exact intersections.
Data-Driven Reachability Analysis of Pedestrians Using Behavior Modes
Previous approaches to predicting the future state sets of pedestrians either do not provide safety guarantees or are overly conservative.
Logical Zonotopes: A Set Representation for the Formal Verification of Boolean Functions
A logical zonotope, which is a new set representation for binary vectors, is introduced in this paper.
Online Control Synthesis for Uncertain Systems under Signal Temporal Logic Specifications
It is shown that when the STL formula is robustly satisfiable and the initial state of the system belongs to the initial root node of the tTLT, it is guaranteed that the trajectory generated by the control synthesis algorithm satisfies the STL formula.
