
The languages of higher-dimensional automata (HDAs) are precisely the subsumption closures of monadic second-order (MSO) definable sets of interval ipomsets of bounded width.


coremsg

logical-characterization-of-higher-dimensional-automata-languages


Logical Characterization of Higher-Dimensional Automata Languages


title_rewrite


The languages recognized by higher-dimensional automata are precisely the rational subsumption-closed sets of finite interval pomsets.


a-kleene-theorem-for-modeling-concurrent-systems-with-higher-dimensional-automata


A Kleene Theorem for Modeling Concurrent Systems with Higher-Dimensional Automata
