The Cost of Monitoring Alone

We compare the succinctness of two monitoring systems for properties of infinite traces, namely parallel and regular monitors. Although a parallel monitor can be turned into an equivalent regular monitor, the cost of this transformation is a double-exponential blowup in the syntactic size of the monitors, and a triple-exponential blowup when the goal is a deterministic monitor. We show that these bounds are tight and that they also hold for translations between corresponding fragments of Hennessy-Milner logic with recursion over infinite traces.Comment: 22 page

Learning automata with side-effects

Automata learning has been successfully applied in the verification of hardware and software. The size of the automaton model learned is a bottleneck for scalability, and hence optimizations that enable learning of compact representations are important. This paper exploits monads, both as a mathematical structure and a programming construct, to design and prove correct a wide class of such optimizations. Monads enable the development of a new learning algorithm and correctness proofs, building upon a general framework for automata learning based on category theory. The new algorithm is parametric on a monad, which provides a rich algebraic structure to capture non-determinism and other side-effects. We show that this allows us to uniformly capture existing algorithms, develop new ones, and add optimizations

Highly Parallel Convolution Method to Compare DNA Sequences with Enforced In/Del and Mutation Tolerance

Текст статьи не публикуется в открытом доступе в соответствии с политикой журнала.New error tolerant method for the comparison and analysis of symbol sequences is proposed. The method is based on convolution function calculation, where the function is defined over the binary numeric sequences obtained by the specific transformation of original symbol sequence. The method allows highly parallel implementation and is of great value for insertion/delition mutations search. To calculate the convolution function, fast Fourier transform is used in the method implementation. Предлагается новый устойчивый к ошибкам метод сравнения и анализа символьных последовательностей. Метод основан на вычислении функции свертки, где функция определяется над двоичными числовыми последовательностями, полученными путем конкретного преобразования исходной последовательности символов. Метод допускает эффективное распараллеливание и имеет большое значение для поиска мутаций вставки / удаления. Для вычисления функции свертки в реализации метода используется быстрое преобразование Фурье

How to Prove that a Language Is Regular or Star-Free?

International audienceThis survey article presents some standard and less standard methods used to prove that a language is regular or star-free