Related papers: Complexity of Ten Decision Problems in Continuous …
Time bounded reachability is a fundamental problem in model checking continuous-time Markov chains (CTMCs) and Markov decision processes (CTMDPs) for specifications in continuous stochastic logics. It can be computed by numerically solving…
We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…
This paper introduces a novel approach to evaluating the asymptotic stability of equilibrium points in both continuous-time (CT) and discrete-time (DT) nonlinear autonomous systems. By utilizing indirect Lyapunov methods and linearizing…
This paper considers time-inconsistent problems when control and stopping strategies are required to be made simultaneously (called stopping control problems by us). We first formulate the timeinconsistent stopping control problems under…
A new necessary and sufficient stability test in a tractable number of operations for linear neutral-type delay systems is introduced. It is developed in the Lyapunov-Krasovskii framework via functionals with prescribed derivatives. The…
Computational complexity is examined using the principle of increasing entropy. To consider computation as a physical process from an initial instance to the final acceptance is motivated because many natural processes have been recognized…
We study the computational complexity of approximating general constrained Markov decision processes. Our primary contribution is the design of a polynomial time $(0,\epsilon)$-additive bicriteria approximation algorithm for finding optimal…
The problem of formulating self-consistent local and global stability exponents is shown to require global separation of variables. Posing the separation of variable problem, we see that many such separations are possible, but only one is…
We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that exponential stability implies the existence of a positive Lyapunov function which is quadratic on…
The paper endeavours to solve the problem of the necessary and sufficient conditions for testing asymptotic stability of the equilibrium state without using a positive definite or semi-definite Lyapunov function for time-invariant nonlinear…
We study systems on time scales that are generalizations of classical differential or difference equations. In this paper we consider linear systems and their small nonlinear perturbations. In terms of time scales and of eigenvalues of…
Detectability has been introduced as a generalization of state-estimation properties of discrete event systems studied in the literature. It asks whether the current and subsequent states of a system can be determined based on observations.…
The interplay among the time-evolution of the coefficients and the zeros of a generic time-dependent (monic) polynomial provides a convenient tool to identify certain classes of solvable dynamical systems. Recently this tool has been…
In this paper, we study the problem of control of discrete-time linear time varying systems over uncertain channels. The uncertainty in the channels is modeled as a stochastic random variable. We use exponential mean square stability of the…
We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…
In this paper we consider the problem of obtaining sharp bounds for the performance of temporal difference (TD) methods with linear function approximation for policy evaluation in discounted Markov decision processes. We show that a simple…
A technique is introduced which allows to generate -- starting from any solvable discrete-time dynamical system involving N time-dependent variables -- new, generally nonlinear, generations of discrete-time dynamical systems, also involving…
Solutions of a smooth first order dynamic equation can be made Lyapunov stable at will by the choice of an appropriate time-dependent Riemannian metric.
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…
We address stability of a class of Markovian discrete-time stochastic hybrid systems. This class of systems is characterized by the state-space of the system being partitioned into a safe or target set and its exterior, and the dynamics of…