4 papers · 1 filter
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…
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…
Higher-Dimensional Timed Automata for Real-Time Concurrency
Amazigh Amrane, Hugo Bazille, Emily Clement +2
We present a new language semantics for real-time concurrency. Its operational models are higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional aut…
Presenting Interval Pomsets with Interfaces
Amazigh Amrane, Hugo Bazille, Emily Clement +2
Interval-order partially ordered multisets with interfaces (ipomsets) have shown to be a versatile model for executions of concurrent systems in which both precedence and concurren…