: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable inter...
We study recursive timed automata that extend timed automata with recursion. Timed automata, as introduced by Alur and Dill, are finite automata accompanied by a finite set of real...
Due to its importance as a model for several software and hardware applications, automata theory is a core topic in computer science and engineering education. But because of its m...
Abstract. On the one hand, modal specifications are classic, convenient, and expressive mathematical objects to represent interfaces of component-based systems. On the other hand, ...
Nathalie Bertrand, Axel Legay, Sophie Pinchinat, J...