🤖 AI Summary
This study addresses the state-space explosion problem in the safety verification of complex concurrent systems by proposing a reachability relaxation method based on hybrid trace nets. The approach integrates hybrid trace net modeling, reachability analysis, and invariant derivation techniques. By introducing a reachability relaxation mechanism to efficiently identify system invariants, it achieves substantial state-space reduction and accelerates safety verification. Experimental results demonstrate that the proposed method increases the proof rate for unsafe states by 1.5 times and improves invariant generation speed by two orders of magnitude, effectively enhancing both verification efficiency and proof coverage.
📝 Abstract
Fault and error detection is crucial for ensuring the correctness of safety-critical systems. Safety verification often addresses reachability of bad system states, where exhaustive state inspection may be intractable due to the large state spaces of complex systems. We propose a reachability relaxation for hybrid trace nets, a useful mathematical model for analyzing concurrent event systems, to efficiently verify system safety. We further use our relaxation to effectively identify invariants, expressions that hold in all reachable states, allowing state-space reduction for efficient verification. Empirically, our approach proves unsafe states unreachable in 1.5x more instances, generates 2.5x more invariants with up to 2 orders of magnitude faster generation times than the baselines in the tested problems.