Photo from archive.org
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… Click to show full abstract
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.
Journal Title: Cybernetics and Systems Analysis
Year Published: 2018
Link to full text (if available)
Share on Social Media: Sign Up to like & get
recommendations!