English
Related papers

Related papers: On Recurrent Reachability for Continuous Linear Dy…

200 papers

We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…

Computational Complexity · Computer Science 2024-05-03 Olivier Bournez , Riccardo Gozzi

We consider a Markov control model in discrete time with countable both state space and action space. Using the value function of a suitable long-run average reward problem, we study various reachability/controllability problems. First, we…

Optimization and Control · Mathematics 2024-06-05 Daniel Avila , Mauricio Junca

Preliminary results of our investigations on solving indefinite qua\-dra\-tic programs by dynamical systems are given. First, dynamical systems corresponding to two fundamental DC programming algorithms to deal with indefinite quadratic…

Optimization and Control · Mathematics 2025-04-01 Massimo Pappalardo , Nguyen Nang Thieu , Nguyen Dong Yen

A constant-rate multi-mode system is a hybrid system that can switch freely among a finite set of modes, and whose dynamics is specified by a finite number of real-valued variables with mode-dependent constant rates. We introduce and study…

Optimization and Control · Mathematics 2016-10-19 Fabio Somenzi , Behrouz Touri , Ashutosh Trivedi

The hybrid optimal control problem with reach time to a target set is addressed and the continuity and uniqueness of the associated value function is proved. Hybrid systems involves interaction of different types of dynamics: continuous and…

Optimization and Control · Mathematics 2016-08-05 Myong-Song Ho , Kwang-Nam Oh , Chol-Jun Hwang

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous…

Systems and Control · Computer Science 2022-05-03 Sergiy Bogomolov , Marcelo Forets , Goran Frehse , Kostiantyn Potomkin , Christian Schilling

The paper studies a class of multidimensional optimal stopping problems with infinite horizon for linear switching diffusions. There are two main novelties in the optimal problems considered: the underlying stochastic process has…

Probability · Mathematics 2021-08-02 Philip Ernst , Hongwei Mei

In this paper we consider the problem of finding an evolution of a dynamical system that originates and terminates in given sets of states. However, if such an evolution exists then it is usually not unique. We investigate this problem and…

Optimization and Control · Mathematics 2017-09-21 Jan Kuratko , Stefan Ratschan

Focusing on hybrid diffusion dynamics involving continuous dynamics as well as discrete events, this article investigates the explicit approximations for nonlinear switching diffusion systems modulated by a Markov chain. Different kinds of…

Numerical Analysis · Mathematics 2021-12-08 Hongfu Yang , Xiaoyue Li

The \emph{Orbit Problem} consists of determining, given a linear transformation $A$ on $\mathbb{Q}^d$, together with vectors $x$ and $y$, whether the orbit of $x$ under repeated applications of $A$ can ever reach $y$. This problem was…

Computational Complexity · Computer Science 2017-01-10 Nathanaël Fijalkow , Pierre Ohlmann , Joël Ouaknine , Amaury Pouly , James Worrell

In this paper, we solve a maximization problem where the objective function is quadratic and convex or concave and the constraints set is the reachable value set of a convergent discrete-time affine system. Moreover, we assume that the…

Optimization and Control · Mathematics 2020-06-18 Assalé Adjé

We study the almost-sure reachability problem in a distributed system obtained as the asynchronous composition of N copies (called processes) of the same automaton (called protocol), that can communicate via a shared register with finite…

Logic in Computer Science · Computer Science 2016-05-06 Patricia Bouyer , Nicolas Markey , Mickael Randour , Arnaud Sangnier , Daniel Stan

This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Radu Iosif

One of the most basic, longstanding open problems in the theory of dynamical systems is whether reachability is decidable for one-dimensional piecewise affine maps with two intervals. In this paper we prove that for injective maps, it is…

Dynamical Systems · Mathematics 2023-03-20 Faraz Ghahremani , Edon Kelmendi , Joël Ouaknine

We present two tools, which could be useful in determining whether or not a non-Homogenous Linear Recurrence can reach a desired rational. First, we derive the determinant that is equal to the ith term in a non-Homogenous Linear Recurrence.…

Discrete Mathematics · Computer Science 2012-01-04 Deepak Ponvel Chermakani

We discuss the solvability of an infinite system of first order ordinary differential equations on the half line, subject to nonlocal initial conditions. The main result states that if the nonlinearities possess a suitable "sub-linear"…

Classical Analysis and ODEs · Mathematics 2015-03-25 Gennaro Infante , Petru Jebelean , Fadila Madjidi

An infinite set is orbit-finite if, up to permutations of the underlying structure of atoms, it has only finitely many elements. We study a generalisation of linear programming where constraints are expressed by an orbit-finite system of…

Logic in Computer Science · Computer Science 2024-11-14 Arka Ghosh , Piotr Hofman , Sławomir Lasota

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…

Logic in Computer Science · Computer Science 2015-07-01 Stefan Wöhrle , Wolfgang Thomas