Model-checkers are powerful tools that can find individual traces through models to satisfy desired properties. These traces provide solutions to a number of problems. Instead of...
There are several systems consisting in an object that moves on the plane by following a given rule. It is frequently observed that these systems eventually fall into an unexplaine...
The class of finite Sturmian words consists of words having particularly simple compressed representation, which is a generalization of the Fibonacci recurrence for Fibonacci word...
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Many different definitions of computational universality for various types of systems have flourished since Turing's work. In this paper, we propose a general definition of un...
Jean-Charles Delvenne, Petr Kurka, Vincent D. Blon...