Related papers: Do Repeat Yourself: Understanding Sufficient Condi…
In this paper we study an event based control algorithm for trajectory tracking in nonlinear systems. The desired trajectory is modelled as the solution of a reference system with an exogenous input and it is assumed that the desired…
We consider the Lagrange problem of optimal control with unrestricted controls and address the question: under what conditions we can assure optimal controls are bounded? This question is related to the one of Lipschitzian regularity of…
We investigate the phenomenon of non-recursive trade-offs between descriptional systems in an abstract fashion. We aim at categorizing non-recursive trade-offs by bounds on their growth rate, and show how to deduce such bounds in general.…
For a branching process in random environment it is assumed that the offspring distribution of the individuals varies in a random fashion, independently from one generation to the other. Interestingly there is the possibility that the…
We consider branching random walk in random environment (BRWRE) and prove the existence of deterministic subsequences along which their maximum, centered at its mean, is tight. This partially answers an open question in arXiv:1711.00852.…
There has been a resurgence of interest in lower bounds whose truth rests on the conjectured hardness of well known computational problems. These conditional lower bounds have become important and popular due to the painfully slow progress…
A cyclic proof system is a proof system whose proof figure is a tree with cycles. The cut-elimination in a proof system is fundamental. It is conjectured that the cut-elimination in the cyclic proof system for first-order logic with…
This paper deals with the stability analysis problem of discrete-time switched linear systems with ranged dwell time. A novel concept called L-switching-cycle is proposed, which contains sequences of multiple activation cycles satisfying…
In this preliminary note, we will illustrate our ideas on automated mechanisms for termination and non-termination reasoning.
Extending our own and others' earlier approaches to reasoning about termination of probabilistic programs, we propose and prove a new rule for termination with probability one, also known as "almost-certain termination". The rule uses both…
We propose a new approach for proving safety of infinite state systems. It extends the analyzed system by transitive relations until its diameter D becomes finite, i.e., until constantly many steps suffice to cover all reachable states,…
We consider a variational problem with boundary singularity and Dirichlet condition. We give a blow-up analysis for sequences of solutions of an equation with exponential nonlinearity. Also, we derive a compactness criterion under some…
The differential equations with piecewise constant argument (DEPCAs, for short) is a class of hybrid dynamical systems (combining continuous and discrete). In this paper, under the assumption that the nonlinear term is partially unbounded,…
Pursuit-Evasion Games (in discrete time) are stochastic games with nonnegative daily payoffs, with the final payoff being the cumulative sum of payoffs during the game. We show that such games admit a value even in the presence of…
Complex reasoning problems are most clearly and easily specified using logical rules, but require recursive rules with aggregation such as count and sum for practical applications. Unfortunately, the meaning of such rules has been a…
The main theme of the article is the study of discrete systems of material points subjected to constraints not only of a geometric type (holonomic constraints) but also of a kinematic type (nonholonomic constraints). The setting up of the…
Infinite games where several players seek to coordinate under imperfect information are known to be intractable, unless the information flow is severely restricted. Examples of undecidable cases typically feature a situation where players…
In this paper, we are concerned with stationarity conditions and qualification conditions for optimization problems with disjunctive constraints. This class covers, among others, optimization problems with complementarity, vanishing, or…
We present a new syntactic criterion for the automatic detection of non-termination in an abstract setting that encompasses a simplified form of term rewriting and logic programming.
We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several…