Related papers: A Modal Characterization of Alternating Approximat…

We introduce first order alternating automata, a generalization of boolean alternating automata, in which transition rules are described by multisorted first order formulae, with states and internal variables given by uninterpreted…

We consider bounded extremum seeking controls for time-varying linear systems with uncertain coefficient matrices and measurement uncertainty. Using a new change of variables, Lyapunov functions, and a comparison principle, we provide…

Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…

The problem of feedback equivalence for control systems is considered. An algebra of differential invariants and criteria for the feedback equivalence for regular control systems are found.

Estimation of the degree of stability and the bounds of solutions to non-autonomous nonlinear systems present major concerns in numerous applied problems. Yet, current techniques are frequently yield overconservative conditions which are…

This work addresses the exact characterization of the covariance dynamics related to linear discrete-time systems subject to both additive and parametric stochastic uncertainties that are potentially unbounded. Using this characterization,…

The physics of Anderson transitions between localized and metallic phases in disordered systems is reviewed. The term ``Anderson transition'' is understood in a broad sense, including both metal-insulator transitions and quantum-Hall-type…

For abstract linear systems in Hilbert spaces we revisit the problems of exact controllability and complete stabilizability (stabilizability with an arbitrary decay rate), the latter property is equivalent to exact null controllability. We…

In this paper, we study the concept of approximate controllability of retarded network systems of neutral type. On one hand, we reformulate such systems as free-delay boundary control systems on product spaces. On the other hand, we use the…

Using the semigroup approach to abstract boundary control problems we characterize the space of all exactly reachable states. Moreover, we study the situation when the controls of the system are required to be positive. The abstract results…

This paper introduces a novel approach to the optimal control of linear discrete-time systems subject to bounded disturbances. Our approach is based on the newly established duality between ellipsoidal approximations of reachable and hardly…

In this paper, the author aims to establish a mathematical model for a mimic computer. To this end, a novel automaton is proposed. First, a one-dimensional cellular automaton is used for expressing some dynamic changes in the structure of a…

Timed transition systems are behavioural models that include an explicit treatment of time flow and are used to formalise the semantics of several foundational process calculi and automata. Despite their relevance, a general mathematical…

Linear complementarity problems provide a powerful framework to model nonsmooth phenomena in a variety of real-world applications. In dynamical control systems, they appear coupled to a linear input-output system in the form of linear…

This paper studies the construction of symbolic abstractions for nonlinear control systems via feedback refinement relation. Both the delay-free and time-delay cases are addressed. For the delay-free case, to reduce the computational…

We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we…

We present an approach to approximate reachable sets for linear systems with bounded L-infinity controls in finite time. Our first approach investigates the boundaries of these sets and reveals an exact characterization for single-input,…

We consider abstract second order systems of the form $\ddot{x}(t) + D \dot{x}(t) + Sx(t)=0$, which are typically analyzed via the operator matrix $\mathcal{A}=\left[\begin{smallmatrix} 0 & I \\ -S & -D \end{smallmatrix}\right]$ governing…

We study two notions of expressiveness, which have appeared in abstraction theory for model checking, and find them incomparable in general. In particular, we show that according to the most widely used notion, the class of Kripke Modal…

Automated synthesis of reactive control protocols from temporal logic specifications has recently attracted considerable attention in various applications in, for example, robotic motion planning, network management, and hardware design. An…