Structural Analysis of Hybrid-Trace Nets: An Optimization Approach
cs.LO, cs.SY, eess.SY
Submitted: 2026-10-06
Updated: 2026-10-06
Comments: 8 pages. Submitted to The 2027 American Control Conference (ACC)
Code: https://github.com/AI-Planning/unsolveipc-2016
Project page: https://ipc2023-numeric.github.io
License: http://creativecommons.org/licenses/by-nc-nd/4.0/
The gist: Fault and error detection is crucial for ensuring the correctness of safety-critical systems.
Terminology
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.
Sources
Related papers
- Formalizing Flag Algebras in Lean
- An Information-Flow Perspective on Explainability Requirements: Specification and Verification
- A programming language combining quantum and classical control
- Causal Past Logic for Runtime Verification of Distributed LLM Agent Workflows
- ADVENT: LLM-Driven Automatic Predicate Invention for ILP
- Encoder-Decoder Transformers: Logical Characterizations and Periodicity