This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted ...
We introduce hybrid branching-time logics as extensions of CT L-like logics with hybrid machinery such as the downarrow-operator. Following recent work in the linear framework, we...
Weighted automata are finite automata with numerical weights on transitions. Nondeterministic weighted automata define quantitative languages L that assign to each word w a real ...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...
The quality of the numeric simulation of hybrid systems highly depends on the capability of the simulator to detect discrete events during continuous evolutions. Due to the intera...
In this work we tackle the following problem: given a timed automaton, and a target set F of configurations, restrict its transition relation in a systematic way so that from ever...