• Citer

Synchronizing words for weighted and timed automata

par Doyen, Laurent ;Markey, Nicolas N.;Shirmohammadi, Mahsa ;Juhl, Line;Larsen, Kim Guldstrand
Référence Leibniz international proceedings in informatics, 29, page (121-132)
Publication Publié, 2014-12

Article révisé par les pairs

• Détails
• Contenu

Résumé :

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 studied for complete deterministic finite automata, with the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-word problems for weighted and timed automata. We consider the synchronization problem in several variants and combinations of these, including deterministic and non-deterministic timed and weighted automata, synchronization to unique location with possibly different clock valuations or accumulated weights, as well as synchronization with a safety condition forbidding the automaton to visit states outside a safety-set during synchronization (e.g. energy constraints). For deterministic weighted automata, the synchronization problem is proven PSPACE-complete under energy constraints, and in 3-EXPSPACE under general safety constraints. For timed automata the synchronization problems are shown to be PSPACE-complete in the deterministic case, and undecidable in the non-deterministic case.