BSU Bulletin. Mathematics, Informatics
Bibliographic description:
,
А METHOD FOR DESCRlBING SYSTEMS WIТH СОМРLЕХ ВЕНАVIOR BASED ON ТНЕ PRINCIPLES OF GENERALIZED АUТОМАТА // BSU Bulletin. Mathematics, Informatics. - 2018. №4. . - С. 22-36.
Title:
А METHOD FOR DESCRlBING SYSTEMS WIТH СОМРLЕХ ВЕНАVIOR BASED ON ТНЕ PRINCIPLES OF GENERALIZED АUТОМАТА
Financing:
Codes:
Annotation:
Automata-based models are most convenient for designing systems with complex behavior, but they have а number of limitations, such as the lack of support for asynchrony and concurrency. Special language tools, both graphic and textual are often used to describe such models. Тhе article presents а method for describing systems with complex behavior using the high-level programming language CIAO (Cooperative lnteraction of Automata Objects). Тhе program of this language generates а system ofautomatic machines, which simulate the functioning ofthe initial reactive system.
Keywords:
asynchronous parallel reactive systems; state-transition graph; syntactic flowgraph in regular form.
List of references:
Novikov F. А , Fedorchenko L. N., VoroЬiev V. 1., Fatkieva R. R., and Levonevskiy D. К. Attribute-Based Approach of Defining the Secure Behavior of Automata Objects. Proceedings ofthe 10th lntemational Conference on Security ofln formation and Networks (SIN 2017), J. В. Sartor, Тh. D' Hondt, and W. De Meuter (Eds.). New York, USA: АСМ, 2017. Рр. 67-72 DOI: https://doi.org/10.l 145/3136825.3136887
Afanasyeva 1. V., Novikov F. А Arkhitektura programmnogo obespecheniya sistem opticheskoi registratsii [Software Architecture of Optical Registration Sys tems]. lnformatsionno-upravlyayushchiesistemy - lnformation Management Systems. 2016. No. 3. Рр. 51-63. DOI: 10.15217 / issue 1684-8853.2016.3.51
Novikov F. А , Afanasyeva 1. V. Kooperativnoe vzaimodeistvie avtomatnykh ob"ektov [Cooperative lnteraction of Automaton Objects]. lnformatsionno upravlyayushchie sistemy - lnformation Management Systems. 2016. No. 6. Рр. 50- 63. DOI: 10.15217 / issnl684-8853.2016.6.50
Harel D. Statecharts: А Visual Formalism for Complex Systems. Science of Computer Programming. 1987. V. 8. Рр. 231-274.
Shalyto А А Paradigma avtomatnogo programmirovaniya [Paradigm of Auto mata-Based Programming]. Nauchno-tekhnicheskii vestnik Sankt-Peterburgskogo go sudarstvennogo universiteta informatsionnykh tekhnologii, mekhaniki i optiki - Sci entific and Technical Bulletin of St. Petersburg State University of lnformation Tech nologies, Mechanics and Optics. 2008. V. 53. Рр. 3-24.
Fedorchenko L. Regularization of Context-Free Grammars. Saarbrucken: Lap Lambert Academic РuЫ., 2011. 180 р.
Fedorchenko L., and Baranov S. Equivalent Transformations and Regularization in Context-Free Grammars. Cybernetics and lnformation Technologies (С!Т). 2015. V. 14. No 4. Рр.11-28.
Aho А , Sethi R., Ullman J. Compilers: Principles, Techniques and Tools. Addi son-Wesley, 1986. 796 р.
Кnuth D. The Art of Computer Programming. V. 1. Fundamental Algorithms. Massachussets, USA: Addison-Wesley, 1968. 634 р.
Polikarpova N. 1., Shalyto А А Avtomatnoe programmirovanie [Automata Based Programming]. St Petersburg: Piter РuЫ., 2011. 176 р.