Černý's conjecture and the road colouring problem
Let A be a complete deterministic finite automaton (DFA) with input alphabet A and state set
Q. We say that such an automaton is synchronising if there exists a word w 2 A such that …
Q. We say that such an automaton is synchronising if there exists a word w 2 A such that …
Computing the shortest reset words of synchronizing automata
In this paper we give the details of our new algorithm for finding minimal reset words of finite
synchronizing automata. The problem is known to be computationally hard, so our algorithm …
synchronizing automata. The problem is known to be computationally hard, so our algorithm …
Efficient state synchronisation in model-based testing through reinforcement learning
Model-based testing is a structured method to test complex systems. Scaling up model-
based testing to large systems requires improving the efficiency of various steps involved in …
based testing to large systems requires improving the efficiency of various steps involved in …
Effective synchronizing algorithms
The notion of a synchronizing sequence plays an important role in the model-based testing
of reactive systems, such as sequential circuits or communication protocols. The main …
of reactive systems, such as sequential circuits or communication protocols. The main …
Approximating the minimum length of synchronizing words is hard
MV Berlinkov - Theory of Computing Systems, 2014 - Springer
Approximating the Minimum Length of Synchronizing Words Is Hard | SpringerLink Skip to main
content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart …
content Advertisement SpringerLink Log in Menu Find a journal Publish with us Search Cart …
Forward and backward synchronizing algorithms
Abstract Automata synchronization has many important applications, mostly in conformance
testing of electrical circuits, self-correcting codes and protocol testing. Finding a shortest …
testing of electrical circuits, self-correcting codes and protocol testing. Finding a shortest …
Multicore and manycore parallelization of cheap synchronizing sequence heuristics
An important concept in finite state machine based testing is synchronization which is used
to initialize an implementation to a particular state. Usually, synchronizing sequences are …
to initialize an implementation to a particular state. Usually, synchronizing sequences are …
Testing experiments on synchronized Petri nets
M Pocci, I Demongodin, N Giambiasi… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
Synchronizing sequences have been proposed in the late 1960s to solve testing problems
on systems modeled by finite-state machines. Such sequences lead a system, seen as a …
on systems modeled by finite-state machines. Such sequences lead a system, seen as a …
A fast algorithm finding the shortest reset words
In this paper we present a new fast algorithm for finding minimal reset words for finite
synchronizing automata, which is a problem appearing in many practical applications. The …
synchronizing automata, which is a problem appearing in many practical applications. The …
Accelerating Finite State Machine-Based Testing using Reinforcement Learning
Testing is a crucial phase in the development of complex systems, and this has led to
interest in automated test generation techniques based on state-based models. Many …
interest in automated test generation techniques based on state-based models. Many …