5 papers
Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
Enzo Erlich, Jérémy Ledent, Krzysztof Ziemiański
Higher-dimensional automata (HDA) are a model of concurrency that models simultaneous execution of events using higher dimensional cells. HDA recognize languages of pomsets, a gene…
Variants of Higher-Dimensional Automata
Hugo Bazille, Jérémy Dubut, Uli Fahrenberg +1
The theory of higher-dimensional automata (HDAs) has seen rapid progress in recent years, and first applications, notably to Petri net analysis, are starting to show. It has, howev…
Büchi-Elgot-Trakhtenbrot Theorem for Higher-Dimensional Automata
Amazigh Amrane, Hugo Bazille, Emily Clement +3
In this paper we explore languages of higher-dimensional automata (HDAs) from an algebraic and logical point of view. Such languages are sets of finite width-bounded interval pomse…
Presheaf automata
Georg Struth, Krzysztof Ziemiański
We introduce presheaf automata as a generalisation of different variants of higher-dimensional automata and other automata-like formalisms, including Petri nets and vector addition…
Closure and Decision Properties for Higher-Dimensional Automata
Amazigh Amrane, Hugo Bazille, Uli Fahrenberg +1
We report some further developments regarding the language theory of higher-dimensional automata (HDAs). Regular languages of HDAs are sets of finite interval partially ordered mul…