arXiv (All)
open access
Contract-Based Decomposition of Temporal Logic Specifications for Networked Systems under Arbitrary Partitions
Computational complexity is an inherent limitation of formal synthesis for networked systems, and decomposing the global specification into local ones relaxes this limitation at the cost of conservatism. Since the granularity of the partition governs this trade-off, it is reasonable to treat the par
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
- Tier-1 Structural Closure_ Formal Rules, Failure Modes, and Consequences of Violation#101817
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#614966
- MechMath: Sorrifier-Driven Formal Decomposition Workflow for Automated Theorem Proving#613999
- (Auto)formalization is supposed to be easy: Trellis process semantics for spelling out rigorous proofs#267690
- Optimal Decision Procedures for Satisfiability in Fragments of Alternating-time Temporal Logics#737257
Record · ID 1049318
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