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.
The languages recognized by higher-dimensional automata are precisely the rational subsumption-closed sets of finite interval pomsets.