Abstract
The paper deals with researching and developing the methods that make it possible to account behaviour examples when synthesizing automaton models by temporal formulas. Definitions of the terms and concepts used in work are given; the problem of synthesizing automaton systems according to the specification in the form of temporal formulas and behaviour examples is formulated; a promising algorithm for reducing the problem of synthesizing automaton systems to the Boolean formula satisfiability problem is described; an analysis of the domain and other approaches is carried out. New methods of taking into account behaviour examples in the synthesis of automaton systems according to a specification given in the form of temporal formulas are proposed. Algorithms for constructing graphs of scripts and methods for dividing graphs into clusters are described; they are designed to increase the efficiency of representing behaviour examples used for coding the behaviour examples in the form of Boolean formulas. An experimental study of the proposed methods of accounting for behaviour examples and basic approaches to the presentation of behaviour examples is carried out. The experimental results showed the superiority of the newly developed methods regarding the presentation of scripts in the form of temporal formulas. In summary, the main conclusions of the work carried out are presented.
Highlights
The synthesis of automata models is a common problem
There are several different approaches to the synthesis of automaton systems, which allow simultaneously taking into account the specification in the form of linear temporal logic formulas and behaviour examples
- An iterative approach based on reducing to the Boolean formula satisfiability problem, the work of which consists of several stages: representing scripts in the form of a script tree, which is represented as a Boolean formula; generating an automaton system according to the obtained formula; checking the synthesized automaton system using the model checking approach (Finkbeiner & Schewe, 2013) for compliance with linear temporal formulas; if counterexamples are identified at the current stage, they are added to the script tree with a special mark and the whole process is repeated anew
Summary
The synthesis of automata models is a common problem. Its field of application ranges from software verification and control system synthesis (Vashkevich & Biktashev, 2016; Peter Faymonville et al, 2017; Biktashev & Vashkevich, 2013; Dubinin et al, 2016) and (Dubinin & Drozdov, 2016; Pashchenko et al, 2020; Pashchenko et al, 2020; Volchikhin et al, 2013) to bioinformatics problems and formal description of parallel algorithms and processes (Vashkevich & Biktashev, 2011; Vashkevich & Biktashev, 2011; Vashkevich et al, 2015). Linear temporal logic formulas are used to define the specification of a synthesized system. In this area, a new promising approach to synthesizing an automaton model with a constraint on the size of the system has recently appeared (Peter Faymonville et al, 2017). The purpose of the paper is to study effective methods of accounting for behaviour examples and compare the methods with other approaches to presenting behaviour examples
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
