SAW

SAW performs safety verification of weakly-hard systems by analyzing reachability on discretized state-space grids to identify safe initial state sets under bounded deadline-miss constraints.

Key Features:

• Safety Verification: Ensures system safety under weakly-hard constraints that allow bounded deadline misses.
• General Nonlinear Systems Support: Supports verification of general nonlinear weakly-hard systems.
• Infinite-Time Safety Verification: Verifies safety over an infinite time horizon using a technique for infinite-time analysis.
• Grid-based State-Space Discretization: Discretizes the safe state set into grids that become nodes of a directed graph.
• Graph-Theoretic Reachability with Dynamic Programming: Constructs the reachability relation between grid nodes using graph theory and dynamic programming.
• Safe Initial Set Identification: Identifies sets of initial grids from which the system can be proven safe under specified weakly-hard constraints.

Scientific Applications:

• Safety analysis of weakly-hard real-time systems: Analyzing and verifying safety properties of real-time systems that permit bounded deadline misses.
• Verification of nonlinear dynamical systems under timing constraints: Verifying safety of general nonlinear dynamical systems subject to weakly-hard timing constraints.
• Infinite-horizon safety assurance: Providing infinite-time horizon safety guarantees via reachability analysis on discretized state spaces.

Methodology:

Discretize the safe state set into grids forming a directed graph of nodes; use graph theory and dynamic programming to construct the reachability relation between grids and identify safe initial grid sets under the specified weakly-hard constraints.