Closed-Relational Reconstruction Systems: Viability, Observable-History Lifting, and Finite Obstruction Certificates
Author:
Open Access
- 24 October 2026
- journal article
- research article
- Published by MDPI AG in Mathematics
- Vol. 14 (21) , 3883
Abstract
A many-to-one observation can create a fictitious history by joining transitions that require incompatible hidden states. We study this problem for compact Hausdorff stage spaces with closed continuation relations and closed observational equivalences. Compactness identifies indefinite viability with viability at every finite horizon and makes every nonliftable infinite observable history detectable by a finite prefix. Exact successor congruence (ESC), a stage-dependent bisimulation condition, guarantees lifting from every initial representative. We also give a strictly weaker necessary-and-sufficient criterion for existence of some lift, formulated using reachable sets of compatible representatives. In finite time-homogeneous systems, a shortest obstruction has at most transitions, making exhaustive verification finite. Arbitrary finite Markov kernels descend exactly when their aggregate probabilities agree within each source class; uniform successor counting is a special case. A complete partially observed control example computes viability, detects a spliced plan, repairs the abstraction, and verifies a nonuniform kernel. A separate common-action proposition distinguishes existential realizability from admissibility for every retained candidate. The contribution is a unified history-level audit and its explicit criteria and certificates, built on classical inverse-limit, bisimulation, lumpability, and subset-construction methods. Physical reconstruction and Reconstruction Before Control motivate the framework; their empirical validity remains outside these model-relative guarantees.
Keywords
All Related Versions
This publication has 22 references indexed in Scilit:
- Generic inverse limits with set-valued functionsTopology and its Applications, 2022
- Inverse limits with set-valued functions having graphs that are arcsTopology and its Applications, 2021
- Introduction to Coalgebra2016
- An Introduction to Inverse Limits with Set-valued Functions2012
- Lectures in Game Theory for Computer Scientists2011
- Antichains: A New Algorithm for Checking Universality of Finite Automata2006
- Equivalence notions and model minimization in Markov decision processesArtificial Intelligence, 2003
- Universal coalgebra: a theory of systemsTheoretical Computer Science, 2000
- Planning and acting in partially observable stochastic domainsArtificial Intelligence, 1998
- Approximation of the viability kernelApplied Mathematics & Optimization, 1994