8 research outputs found
P(l)aying for Synchronization
Two topics are presented: synchronization games and synchronization costs. In
a synchronization game on a deterministic finite automaton, there are two
players, Alice and Bob, whose moves alternate. Alice wants to synchronize the
given automaton, while Bob aims to make her task as hard as possible. We answer
a few natural questions related to such games. Speaking about synchronization
costs, we consider deterministic automata in which each transition has a
certain price. The problem is whether or not a given automaton can be
synchronized within a given budget. We determine the complexity of this
problem. We also formulate a few open questions.Comment: Version 1 (by F\"odor Fominykh and Mikhail Volkov): 12 pages, 5
figures, close to the version published in the Proceedings of the 17th
International Conference on Implementation and Application of Automata (LNCS
7381). Version 2: 19 pages, 7 figures, one of the problems left open in
Version 1 solved, submitte
Reachability of Consensus and Synchronizing Automata
We consider the problem of determining the existence of a sequence of
matrices driving a discrete-time consensus system to consensus. We transform
this problem into one of the existence of a product of the transition
(stochastic) matrices that has a positive column. We then generalize some
results from automata theory to sets of stochastic matrices. We obtain as a
main result a polynomial-time algorithm to decide the existence of a sequence
of matrices achieving consensus.Comment: Update after revie
Synchronizing Words for Weighted and Timed Automata
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
Polynomial Time Decidability of Weighted Synchronization under Partial Observability
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 whether the current weight-level is negative or nonnegative. We show that the synchronization problem is decidable in polynomial time for deterministic weighted automata
Synchronizing automata over nested words
We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i. e., takes the NWA from all control states to a single control state.
We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in the size of the NWA, the existence of such a word can still be decided in polynomial time. As our main contribution, we show that deciding the existence of a short synchronizing word (of at most given length) becomes PSPACE-complete (as opposed to NP-complete for DFA). The upper bound
makes a connection to pebble games and Strahler numbers, and the lower bound goes via small-cost synchronizing words for DFA, an intermediate problem that we also show PSPACE-complete. We also characterize the complexity of a number of related problems, using the observation that the intersection nonemptiness problem for NWA
is EXP-complete
P(l)aying for synchronization
Two topics are presented: synchronization games and synchronization costs. In a synchronization game on a deterministic finite automaton, there are two players, Alice and Bob, whose moves alternate. Alice wants to synchronize the given automaton, while Bob aims to make her task as hard as possible. We answer a few natural questions related to such games. Speaking about synchronization costs, we consider deterministic automata in which each transition has a certain price. The problem is whether or not a given automaton can be synchronized within a given budget. We determine the complexity of this problem. © 2012 Springer-Verlag