Research map / Probabilistic and scientific modeling / Dynamical systems
Automated Verification and Tightening of Failure Propagation Models
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| relax TFPG time bounds (tmin to 0, tmax doubled) instead of tight bounds | completeness check · 212 use cases | solving time | Helped |
| tightening time bounds versus only checking completeness | parameter synthesis · 212 use cases | solving time | Hurt |
Closest papers by meaning
- GUITAR: Structured Failure Diagnosis of GUI Agents via State Transitions (NeurIPS 2026 · similarity 0.77)
- DiagnosticIQ: A Benchmark for LLM-Based Industrial Maintenance Action Recommendation from Symbolic Rules (NeurIPS 2026 · similarity 0.76)
- HierSVA: A Synthesis Pipeline, Dataset, and Benchmark for LLM-Driven Hierarchical Hardware Formal Verification (NeurIPS 2026 · similarity 0.76)
- Foundations of Reactive Synthesis for Declarative Process Specifications (AAAI 2024 · similarity 0.76)
- Neural Model Checking (NeurIPS 2024 · similarity 0.76)
- Disentangled Table-Graph Representation for Interpretable Transmission Line Fault Location (AAAI 2025 · similarity 0.75)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.