4 citations · 4 across the 7 of their papers we have counts for
9 papers
Automata on Graph Alphabets
Hugo Bazille, Uli Fahrenberg
The theory of finite automata concerns itself with words in a free monoid together with concatenation and without further structure. There are, however, important applications whic…
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…
Higher-Dimensional Automata : Extension to Infinite Tracks
Luc Passemard, Amazigh Amrane, Uli Fahrenberg
We introduce higher-dimensional automata for infinite interval ipomsets (-HDAs). We define key concepts from different points of view, inspired from their finite counterparts. T…
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…
Myhill-Nerode Theorem for Higher-Dimensional Automata
Uli Fahrenberg, Krzysztof Ziemiański
We establish a Myhill-Nerode type theorem for higher-dimensional automata (HDAs), stating that a language is regular if and only if it has finite prefix quotient. HDAs extend stand…
Kleene Theorem for Higher-Dimensional Automata
Uli Fahrenberg, Christian Johansen, Georg Struth +1
We prove a Kleene theorem for higher-dimensional automata. It states that the languages they recognise are precisely the rational subsumption-closed sets of finite interval pomsets…
Posets with Interfaces as a Model for Concurrency
Uli Fahrenberg, Christian Johansen, Georg Struth +1
We introduce posets with interfaces (iposets) and generalise their standard serial composition to a new gluing composition. In the partial order semantics of concurrency, interface…
Compositionality for Quantitative Specifications
Uli Fahrenberg, Jan Křetínský, Axel Legay +1
We provide a framework for compositional and iterative design and verification of systems with quantitative information, such as rewards, time or energy. It is based on disjunctive…