Axiomatic shared-medium coordination for stigmergic systems

Stigmergic coordination has many medium-specific formalizations. This paper formulates a medium-agnostic comparison layer whose comparison object is the abstract enabled-response signature. For metadata refinements, we prove that a coarse quotient is response-adequate exactly when each quotient fiber is response-aligned. When that fails, there is a canonical coarsest response-adequate repair, and every response-adequate repair must retain at least the corresponding fiberwise number of response classes. On the dynamic side, quotient-compatible matched writes preserve one-step behavior, freshness-conditional actions yield a one-step non-liftability obstruction, and the matched one-step result lifts to finite serial traces. These results are instantiated for a tuple-space medium and a timestamped virtual-stigmergic dataspace. The result is a medium-agnostic comparison framework with one explicit positive/negative theorem cycle; richer pathwise and concurrent semantics remain outside scope.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-06-12
DOI
https://doi.org/10.5281/zenodo.20661578
Primary Topic
Logic, programming, and type systems
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Axiomatic shared-medium coordination for stigmergic systems

Fernando Paredes Garcia
Zenodo (CERN European Organization for Nuclear Research)
Logic, programming, and type systems
preprint

Axiomatic shared-medium coordination for stigmergic systems

Fernando Paredes Garcia
preprint en

Abstract

Stigmergic coordination has many medium-specific formalizations. This paper formulates a medium-agnostic comparison layer whose comparison object is the abstract enabled-response signature. For metadata refinements, we prove that a coarse quotient is response-adequate exactly when each quotient fiber is response-aligned. When that fails, there is a canonical coarsest response-adequate repair, and every response-adequate repair must retain at least the corresponding fiberwise number of response classes. On the dynamic side, quotient-compatible matched writes preserve one-step behavior, freshness-conditional actions yield a one-step non-liftability obstruction, and the matched one-step result lifts to finite serial traces. These results are instantiated for a tuple-space medium and a timestamped virtual-stigmergic dataspace. The result is a medium-agnostic comparison framework with one explicit positive/negative theorem cycle; richer pathwise and concurrent semantics remain outside scope.

Zenodo (CERN European Organization for Nuclear Research)
Reduced inequalities
Logic, programming, and type systems
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.