Metraipolis › archive › dc_d0565798fbb1
Endpoint Sufficiency Behavioral Quotients — arXiv:2608.06386
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.06386
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-23T15:19:01.324Z
- SHA-256 of the archived text
7af6d909b8d124daf55c5703be739784c0f234657518eb135eabcd77bb8e5ed8- Stable URL of this page
https://metraipolis.com/documento/dc_d0565798fbb1
How to cite
Endpoint Sufficiency Behavioral Quotients — arXiv:2608.06386 — arXiv (en), https://arxiv.org/abs/2608.06386 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d0565798fbb1 (Metraipolis archive dc_d0565798fbb1, sha256 7af6d909b8d124daf55c5703be739784c0f234657518eb135eabcd77bb8e5ed8)
BibTeX
@misc{dcd0565798fbb1,
title = {Endpoint Sufficiency Behavioral Quotients — arXiv:2608.06386},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.06386},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d0565798fbb1; sha256 7af6d909b8d124daf55c5703be739784c0f234657518eb135eabcd77bb8e5ed8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.06386. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
A provenance-decorated generative system may contain distinct occurrences with the same visible endpoint. The central abstraction question is therefore exact: when may provenance be forgotten without changing the lawful future? We study this question through the labeled transition system induced by lawful generation and an endpoint projection U from occurrences to visible objects. Three observation levels are separated. Enabled sufficiency preserves immediately available rule labels; trace sufficiency preserves all finite lawful rule-label traces; quotient sufficiency preserves the branching transition structure modulo endpoint equivalence. The resulting hierarchy is strict. At the linear-time level, endpoint trace sufficiency is exactly inclusion of endpoint equivalence in finite-trace equivalence. At the branching level, the canonical endpoint quotient is representative-independent exactly when endpoint equivalence is a strong bisimulation equivalence. Two canonical repairs follow. Intersecting endpoint equivalence with trace equivalence gives the greatest endpoint-respecting relation preserving finite traces. The greatest endpoint-respecting bisimulation gives the maximally coarse exact branching quotient and is universal among endpoint-respecting exact quotients. For finite systems it is computed by a terminating partition-refinement procedure initialized by endpoint classes. A self-contained application to provenance-decorated nested recursive-recombinant generation exhibits two occurrences with the same visible graph I->A->B but different enabled futures; the refinement procedure separates them in its first round. The result replaces an all-or-nothing demand to retain provenance with an exact criterion for retaining only the distinctions that remain behaviorally operative. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-10 in cs.LO). Categorie arXiv: Logic in Computer Science (cs.LO). Pagina del lavoro: https://arxiv.org/abs/2608.06386 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-23T15:09:24.940Z dalla pagina https://arxiv.org/catchup/cs.LO/2026-08-10?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).