P(L)Aying for Synchronization

@inproceedings{Fominykh2012PLAyingFS,
  title={P(L)Aying for Synchronization},
  author={Fodor Fominykh and Pavel Martyugin and Mikhail Volkov},
  booktitle={Int. J. Found. Comput. Sci.},
  year={2012}
}
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… 

Figures from this paper

The Synchronization Game on Subclasses of Automata

TLDR
This paper focuses on so-called synchronization games, and discusses how to present synchronization questions in a playful way, which leads to study related complexity questions on certain classes of finite automata.

Synchronizing Words for Weighted and Timed Automata

TLDR
This paper considers synchronizing-word problems for weighted and timed automata, and shows the synchronization problems are shown to be PSPACE-complete in the deterministic case, and undecidable in the non-deterministic case.

Qualitative analysis of synchronizing probabilistic systems

TLDR
The problem of deciding whether an MDP is winning, for each synchronizing and winning mode is considered, and matching upper and lower complexity bounds of the problems, as well as the memory requirement for optimal winning strategies are established.

Synchronizing Words for Timed and Weighted Automata

TLDR
This paper considers synchronizing-word problems for timed and weighted automata, and proves the synchronization problem is proven PSPACE-complete under energy constraints, and in 3-EXPSPACE under general safety constraints.

Qualitative Analysis of Probabilistic Synchronizing Systems

TLDR
The problem of deciding whether an MDP is winning, for each synchronizing and winning mode is considered, and matching upper and lower complexity bounds of the problems are established, as well as the memory requirement for optimal winning strategies.

Synchronizing Strategies under Partial Observability

TLDR
This work extends the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset-to-subset synchronization problems under partial observability, concluding that for deterministic systems the complexity of the problems underpartial observability remains the same as for the classical synchronization problems.

Aalborg Universitet Synchronizing Strategies under Partial Observability

TLDR
This work extends the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset-to-subset synchronization problems under partial observability, concluding that for deterministic systems the complexity of the problems underpartial observability remains the same as for the classical synchronization problems.

Aalborg Universitet Synchronizing Strategies under Partial

TLDR
This work extends the existing theory of synchronizing words to synchronizing strategies, and study the synchronization, short-synchronization and subset-to-subset synchronization problems under partial observability, concluding that for deterministic systems the complexity of the problems underpartial observability remains the same as for the classical synchronization problems.

Approximation algorithm for finding short synchronizing words in weighted automata

TLDR
First the issue of finding possibly short synchronizing words in automata with weight assigned to each letter in the alphabet Σ is dealt with, and then new approximation algorithm in four variations is presented.

References

SHOWING 1-10 OF 24 REFERENCES

The Synchronizing Probability Function of an Automaton

  • R. Jungers
  • Computer Science
    SIAM J. Discret. Math.
  • 2012
TLDR
It is proved that the synchronization process cannot stagnate too long in a certain sense and a new conjecture is proposed and demonstrated that its validity would imply Cerný's conjecture.

The road coloring problem

TLDR
The positive solution of the road coloring problem is presented and a word in the alphabet of colors of its edges that maps the automaton to a single state is presented.

Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA

We show that the problem of checking careful synchronizability of partial finite automata and the problem of finding the shortest carefully synchronizing word are PSPACE-complete. We show that the

Reset Sequences for Monotonic Automata

TLDR
A new algorithm based on breadth-first search is presented that runs in faster asymptotic time than Natarajan’s algorithms, and in addition finds the shortest possible reset sequence if such a sequence exists.

The Theory of Definite Automata

TLDR
A notion of equivalence of definite events is introduced and the uniqueness of the minimal automaton defining an event in an equivalence class is proved.

Modifying the upper bound on the length of minimal synchronizing word

TLDR
The upper bound on the length of the minimal synchronizing word is reduced to n(7n2 +6n - 16)/48, which is close to the best upper bound (n3 - n)/6 that was found almost 30 years ago.

Homing and Synchronizing Sequences

  • S. Sandberg
  • Biology
    Model-Based Testing of Reactive Systems
  • 2004
This chapter considers two fundamental problems for Mealy machines, i.e., finite-state machines with inputs and outputs. The machines will be used in subsequent chapters as models of a system or

Play to Test

TLDR
This work studies reachability games in the context of testing, which may involve many instances of a reachability game and the importance of optimal or near optimal strategies for reachability strategies.

Synchronizing automata with a letter of deficiency 2