@inproceedings{10.1007/978-3-642-29709-0_22,
    Abstract = {In this paper we investigate a case of the reachability problem in controlled o-minimal dynamical systems. This problem can be formulated as follows. Given a controlled o-minimal dynamical system initial and target sets, find a finite choice of time points and control parameters applied at these points such that the target set is reachable from the initial set. We prove that the existence of a finite control strategy is decidable and construct a polynomial complexity algorithm which generates finite control strategies for one-dimensional controlled polynomial dynamical systems. For this algorithm we also show an upper bound on the numbers of switches in finite control strategies.},
    Address = {Berlin, Heidelberg},
    Author = {Korovina, Margarita and Vorobjov, Nicolai},
    BookTitle = {Perspectives of Systems Informatics},
    Editor = {Clarke, Edmund and Virbitskaite, Irina and Voronkov, Andrei},
    File = {Reachability in One-Dimensional Controlled Polynomial Dynamical Systems - dynamical\_final - a.pdf},
    ISBN = {978-3-642-29709-0},
    Pages = {251--261},
    Publisher = {Springer Berlin Heidelberg},
    Title = {Reachability in One-Dimensional Controlled Polynomial Dynamical Systems},
    Year = {2012},
    date-added = {2023-02-04 08:40:35 +0100},
    date-modified = {2023-02-04 08:40:35 +0100},
    doi = {10.1007/978-3-642-29709-0_22}
}

@inproceedings{10.1007/978-3-642-29709-0_22, Abstract = {In this paper we investigate a case of the reachability problem in controlled o-minimal dynamical systems. This problem can be formulated as follows. Given a controlled o-minimal dynamical system initial and target sets, find a finite choice of time points and control parameters applied at these points such that the target set is reachable from the initial set. We prove that the existence of a finite control strategy is decidable and construct a polynomial complexity algorithm which generates finite control strategies for one-dimensional controlled polynomial dynamical systems. For this algorithm we also show an upper bound on the numbers of switches in finite control strategies.}, Address = {Berlin, Heidelberg}, Author = {Korovina, Margarita and Vorobjov, Nicolai}, BookTitle = {Perspectives of Systems Informatics}, Editor = {Clarke, Edmund and Virbitskaite, Irina and Voronkov, Andrei}, File = {Reachability in One-Dimensional Controlled Polynomial Dynamical Systems - dynamical_final - a.pdf}, ISBN = {978-3-642-29709-0}, Pages = {251--261}, Publisher = {Springer Berlin Heidelberg}, Title = {Reachability in One-Dimensional Controlled Polynomial Dynamical Systems}, Year = {2012}, date-added = {2023-02-04 08:40:35 +0100}, date-modified = {2023-02-04 08:40:35 +0100}, doi = {10.1007/978-3-642-29709-0_22} }