The problem of synchronizing automata is concerned with the existence of a word that sends
all states of the automaton to one and the same state. This problem has classically been …

Embedded devices usually share only partial information about their current configurations
as the communication bandwidth can be restricted. Despite this, we may wish to bring a …

Synchronizing a (deterministic, finite-state) automaton is the problem of finding a sequence
of actions to be played in the automaton in order to end up in the same state independently …

We consider Markov decision processes (MDP) as generators of sequences of probability
distributions over states. A probability distribution is p-synchronizing if the probability mass is …

Register automata (RAs) are finite automata extended with a finite set of registers to store
and compare data. We study the concept of synchronizing data words in RAs: Does there …

We consider synchronizing properties of Markov decision processes (MDP), viewed as
generators of sequences of probability distributions over states. A probability distribution is p …

Markov decision processes (MDP) are finite-state systems with both strategic and
probabilistic choices. After fixing a strategy, an MDP produces a sequence of probability …

Qualitative Analysis of Probabilistic Synchronizing Systems Mahsa Shirmohammadi Page 1
UNIVERSITÉ LIBRE DE BRUXELLES Service des méthodes formelles et vérification ÉCOLE …

We introduce two generalizations of synchronizability to automata with transitions weighted
in an arbitrary semiring K=(K,+,*, 0, 1).(or equivalently, to finite sets of matrices in K^ nxn.) …

We consider weighted automata with both positive and negative integer weights on edges
and study the problem of synchronization using adaptive strategies that may only observe …