- Full text PDF available (9)
- This year (0)
- Last 5 years (2)
- Last 10 years (6)
Journals and Conferences
Algorithmization and programming principles for logic control and “reactive” systems are formulated, regarding algorithms and programs as finite automata. The application of finite automata to programming for other problems is also reviewed.
A technology for developing software for reactive systems is proposed that supports the stages of the subject domain investigation, analysis, design, implementation, debugging, certification, and documenting. The technology is based on the automaton approach.
BACKGROUND Hypertrophic cardiomyopathy is a common genetic cardiac disease. Prevention and early diagnosis of this disease are very important. Because of the large number of causative genes and the high rate of mutations involved in the pathogenesis of this disease, traditional methods of early diagnosis are ineffective. METHODS We developed a custom… (More)
A method for designing and implementing reactive object-oriented programs with explicit emphasis of states is suggested. The method relies on the automata-based programming (SWITCH-technology) and the UML notation. The UniMod tool based on this method, which is a plug-in module for the Eclipse platform, is described.
Modern software development processes usually outline phases of requirements gathering, design, coding and testing. Design phase outgoing artefact is system model, described with a help of diagrams and text. On coding phase, developers, using system model, implement system for target platform. There is a semantic gap between design and coding phases,… (More)
The technology of modeling of one class of multi-agent systems with automata based programming is proposed in the paper. The technology is illustrated on the example of system of interacting drone flying objects creation. UniMod - a tool intended for supporting automata based programming is used for building a control system for each flying object. UniMod… (More)
It is shown that the scheme of any iterative algorithm (program) can be realized by a do-while statement with a switch statement as its body that realizes the finite-state automaton transition graph constructed formally by the given scheme. This realization is simpler than that by the Ashcroft–Manna method.
State-based object-oriented programming combines basic advantages of object-oriented and automata-based programming technologies. Its basic features are flexibility, extensibility, and powerful mechanism of description of complex behavior, which is based on finite automata. The disadvantage of the state-based object-oriented programming is the lack of… (More)
In everyday life information technology are increasingly used both directly (by using computers and internet) and indirectly (by using TV, microwaves, mobile phones, cars, public transport etc). In 1995 it was estimated that a person interacts daily with 25 devices processing information. We also know that 20% of the cost of developing vehicles, trains and… (More)
This article gives a short overview of tool UniMod 2, which is now being developed by group of students of SaintPetersburg State University of Information Technologies, Mechanics and Optics. This instrumental tool is designed to develop automata based software, providing means for visual software building, software verification and validation, as well as… (More)