О некоторых задачах анализа гибридных автоматов / Скобелев В. В., Скобелев В. Г. (2018)
Ukrainian

English  Cybernetics and Systems Analysis   /     Issue (2018, 54 (4))

Skobelev V.V., Skobelev V.G.
Some problems from the analysis of hybrid automata

A class of 1-dimensional hybrid automata is defined in which the dynamics at each discrete state for different sets of initial values of a continuous state can be represented by different differential equations, and a finite duration of this dynamics, which can be different for different sets of initial values of such a continuous state, is specified. Algorithms are proposed to solve problems of eliminating contradictions in the objects that define a hybrid automaton, matching these objects with one another, finding the minimum number of switchings, and estimating the minimum time required to reach discrete states from a set of initial discrete states. © 2018, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords: hybrid automata, verification, Differential equations, Verification, Continuous state, Discrete state, Finite duration, Hybrid automatons, Minimum time, Automata theory


Cite:
Skobelev V.V., Skobelev V.G. (2018). Some problems from the analysis of hybrid automata. Cybernetics and Systems Analysis, 54 (4), 3-15. doi: https://doi.org/10.1007/s10559-018-0053-9 http://jnas.nbuv.gov.ua/article/UJRN-0000889041 [In Russian].


 

Інститут інформаційних технологій НБУВ


+38 (044) 525-36-24
Голосіївський просп., 3, к. 209
м. Київ, 03039, Україна