Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Leibniz International Proceedings in Informatics, LIPIcs |
| Number of pages | 12 |
| Volume | 29 |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| Publication date | 11 Dec 2014 |
| Pages | 121-132 |
| ISBN (Print) | 9783939897774 |
| DOIs | |
| Publication status | Published - 11 Dec 2014 |
| Event | 34th International Conference on Foundation of Software Technology and Theoretical Computer Science - New Delhi, India Duration: 15 Dec 2014 → 17 Dec 2014 Conference number: 34 |
Conference
| Conference | 34th International Conference on Foundation of Software Technology and Theoretical Computer Science |
|---|---|
| Number | 34 |
| Country/Territory | India |
| City | New Delhi |
| Period | 15/12/2014 → 17/12/2014 |
Keywords
- Synchronizing words
- Timed automata
- Weighted automata