AUTOMATA PROGRAMS CONSTRUCTION FROM SPECIFICATION WITH AN ANT COLONY OPTIMIZATION ALGORITHM BASED ON MUTATION GRAPH
| Autor: | Daniil S. Chivilikhin, Vladimir I. Ulyantsev, Valeriy V. Vyatkin, Anatoly A. Shalyto |
|---|---|
| Jazyk: | English<br />Russian |
| Rok vydání: | 2014 |
| Předmět: | |
| Zdroj: | Naučno-tehničeskij Vestnik Informacionnyh Tehnologij, Mehaniki i Optiki, Vol 14, Iss 6, Pp 98-105 (2014) |
| Druh dokumentu: | article |
| ISSN: | 2226-1494 2500-0373 |
| Popis: | The procedure of testing traditionally used in software engineering cannot guarantee program correctness; therefore verification is used at the excess requirements to programs reliability. Verification makes it possible to check certain properties of programs in all possible computational states; however, this process is very complex. In the model checking method a model of the program is built (often, manually) and requirements in terms of temporal logic are formulated. Such temporal properties of the model can be checked automatically. The main issue in this framework is the gap between the program and its model. Automata-based programming paradigm gives the possibility to overcome this limitation. In this paradigm, program logic is represented using finite-state machines. The advantage of finite-state machines is that their models can be constructed automatically. The paper deals with the application of mutation-based ant colony optimization algorithm to the problem of finite-state machine construction from their specification, defined by test scenarios and temporal properties. The presented approach has been tested on the elevator doors control problem as well as on randomly generated data. Obtained results show the ant colony algorithm is two-three times faster than the previously used genetic algorithm. The proposed approach can be recommended for inferring control programs for critical systems. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|