Boundary Observability Posting

This record presents a reproducible computational framework for studying attractor-basin observability in finite deterministic dynamical systems under restricted local observation. The central problem is whether the eventual attractor basin of an initial state can be identified from a finite spatiotemporal history observed only at a selected subset of system variables. The framework combines exhaustive state-space enumeration, exact attractor and basin identification, restricted observation histories, Bayes-optimal classification, information-theoretic quantities, boundary descriptors, perturbation detectability, and direct overlap between histories generated by different basins. The methodology is evaluated on two finite dynamical-system classes. The first benchmark includes all 256 elementary cellular automata on a periodic seven-cell ring, with complete enumeration of all 128 initial states. The second experiment evaluates 100 synchronous random Boolean networks with seven nodes and two inputs per node. The results show that global basin and transition-graph descriptors can predict observability strongly within the elementary cellular automata class, but the same structural relationships generalize poorly to random Boolean networks. Boundary topology and perturbation detectability provide additional information, but only partially explain the remaining classification difficulty. Direct overlap between observation histories generated by different attractor basins provides the clearest description of irreducible ambiguity. The work does not propose a new entropy measure, classifier, or universal law of observability. Its contribution is methodological and computational: it provides an exact and reproducible protocol for comparing global dynamics, observation boundaries, finite observation horizons, and Bayes-optimal attractor-basin classification. This Zenodo record contains the manuscript, LaTeX source, and publication figures. The reported results apply to the finite system sizes, observation boundaries, and observation horizons tested in the study.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-08-03
DOI
https://doi.org/10.5281/zenodo.21777655
Primary Topic
Cellular Automata and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Boundary Observability Posting

Petar Dryanovski
Zenodo (CERN European Organization for Nuclear Research)
Cellular Automata and Applications
article

Boundary Observability Posting

Petar Dryanovski
article en

Abstract

This record presents a reproducible computational framework for studying attractor-basin observability in finite deterministic dynamical systems under restricted local observation. The central problem is whether the eventual attractor basin of an initial state can be identified from a finite spatiotemporal history observed only at a selected subset of system variables. The framework combines exhaustive state-space enumeration, exact attractor and basin identification, restricted observation histories, Bayes-optimal classification, information-theoretic quantities, boundary descriptors, perturbation detectability, and direct overlap between histories generated by different basins. The methodology is evaluated on two finite dynamical-system classes. The first benchmark includes all 256 elementary cellular automata on a periodic seven-cell ring, with complete enumeration of all 128 initial states. The second experiment evaluates 100 synchronous random Boolean networks with seven nodes and two inputs per node. The results show that global basin and transition-graph descriptors can predict observability strongly within the elementary cellular automata class, but the same structural relationships generalize poorly to random Boolean networks. Boundary topology and perturbation detectability provide additional information, but only partially explain the remaining classification difficulty. Direct overlap between observation histories generated by different attractor basins provides the clearest description of irreducible ambiguity. The work does not propose a new entropy measure, classifier, or universal law of observability. Its contribution is methodological and computational: it provides an exact and reproducible protocol for comparing global dynamics, observation boundaries, finite observation horizons, and Bayes-optimal attractor-basin classification. This Zenodo record contains the manuscript, LaTeX source, and publication figures. The reported results apply to the finite system sizes, observation boundaries, and observation horizons tested in the study.

Zenodo (CERN European Organization for Nuclear Research)
Peace, Justice and strong institutions
Openalex Percentile: Top 7%
Cellular Automata and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.