2 papers
cs.FL2026
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…
cs.FL2025
Kamp Theorem for Pomset Languages of Higher Dimensional Automata
Emily Clement, Enzo Erlich, Jérémy Ledent
Temporal logics are a powerful tool to specify properties of computational systems. For concurrent programs, Higher Dimensional Automata (HDA) are a very expressive model of non-in…