Skip to content
DraconiticResearch
Search Sources API
201,642 studies31 sourcesUpdated 12 min ago
PreprintarXiv licencearXiv

Track objects in cubical presheaf automata

Abstract

Using the formalism of presheaf automata, we introduce new classes of automata for modelling concurrency that extend higher-dimensional automata and symmetric higher-dimensional automata. We study their languages and characterise these languages in terms of posetal cospans.

Related

  1. Presheaf structures governed by oriented matroids and pseudohyperplane arrangements
    Basile Coron, Denis Lyskov
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  2. Deformation cones of 2-cubical combinatorial zonotopes
    Juliana Curtis, Grace O'Brien, Arnau Padrol +1
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. Boundary Dynamics, Cubical Actions, and Infinite Girth
    Tattwamasi Amrutam, Arka Banerjee, Daniel L. Gulbrandsen +1
    arXivPreprintarXiv licenceFull textAlgebra & number theoryDynamical systemsarXiv
  4. A cubical approach to homology theories for hypergraphs
    Syed Hadi Ali Zaidi, Samira Sahar Jamil
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. Cartan calculus of cubical forms in tangent categories
    Christian Blohmann
    arXivPreprintarXiv licenceFull textAlgebra & number theoryGeometry & topologyarXiv
BibTeX
@misc{struth2026track,
  title = {{Track objects in cubical presheaf automata}},
  author = {Georg Struth and Krzysztof Ziemiański},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.16376},
  eprint = {2610.16376},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.16376},
}
RIS
TY  - UNPB
TI  - Track objects in cubical presheaf automata
AU  - Georg Struth
AU  - Krzysztof Ziemiański
PY  - 2026
DA  - 2026/10/12
PB  - arXiv
DO  - 10.48550/arxiv.2610.16376
UR  - https://arxiv.org/abs/2610.16376
AB  - Using the formalism of presheaf automata, we introduce new classes of automata for modelling concurrency that extend higher-dimensional automata and symmetric higher-dimensional automata. We study their languages and characterise these languages in terms of posetal cospans.
ER  -