<mods:mods version="3.3" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-3.xsd" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"><mods:titleInfo><mods:title>On finite-dimensional parametrizations of attainability sets</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">V.I.</mods:namePart><mods:namePart type="family">Heymann</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">A.V.</mods:namePart><mods:namePart type="family">Kryazhimskiy</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>The attainability set is defined to be a finite-dimensional integral-type image of the set of all absolutely continuous scalar functions of time whose derivatives take values in a given interval. For a class of control systems with scalar controls restricted to the above interval (the class comprises, in particular, some bilinear systems), the attainability set has the traditional meaning. A method of finite-dimensional parametrization of the attainability set is described. The parametrization is universal, i.e., the same for all attainability sets of a fixed dimension. For the case of control systems, the result provides an upper estimate on the number of switchings sufficient to bring the system to an arbitrary reachable state at a prescribed time.</mods:abstract><mods:originInfo><mods:dateIssued encoding="iso8601">1996-09</mods:dateIssued></mods:originInfo><mods:originInfo><mods:publisher>Elsevier</mods:publisher></mods:originInfo><mods:genre>Article</mods:genre></mods:mods>