arXiv (All)
open access
Probably Approximately Correct Guarantees for Data-Driven Reachability Analysis: A Theoretical and Empirical Comparison
Reachability analysis evaluates system safety by identifying the set in which states may evolve over a time horizon. Data-driven reachability analysis estimates reachable sets and derives probabilistic guarantees directly from data. Several popular techniques for validating reachable sets---conforma
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Foundational Admissibility Framework#111516
- Foundations of systems and properties : methodological support for modeling properties of software-intensive systems#445084
- Failure Boundary Detection: Admissibility Limits in Engineering System Stability#731339
- Natural Possibility Paper 1 Foundations#71154
- Towards Improving the External Validity of Software Engineering Experiments with Transportability Methods#2667
Record · ID 1036665
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive