arXiv (All)
open access
Quantitative Verification of Infinite-State Networks
Many network protocols and distributed systems combine recursion, unbounded local state, and quantitative behaviour such as cost, latency, or reliability. Existing decidability results for networks of pushdown systems are largely qualitative, and do not extend to quantitative analyses, which must jo
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
- Proof-of-Continuity: A Temporal Model for Authority Propagation in Distributed Systems and AI Agents#361419
- Networks, Complexity and Its Applications#67199
- The Unified Admissibility Equation#699635
- Convergence Analysis of Distributed Optimization: A Dissipativity Framework#1084072
- ConflictSync: Bandwidth Efficient Synchronization of Divergent State#1187227
Record · ID 1249271
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