Related papers: Quantification of reachable attractors in asynchro…
Despite the possibility to quickly compute reachable sets of large-scale linear systems, current methods are not yet widely applied by practitioners. The main reason for this is probably that current approaches are not push-button-capable…
In this paper a novel computational technique for finite discrete approximation of continuous dynamical systems suitable for a significant class of biochemical dynamical systems is introduced. The method is parameterized in order to affect…
We study timed systems in which some timing features are unknown parameters. Parametric timed automata (PTAs) are a classical formalism for such systems but for which most interesting problems are undecidable. Notably, the parametric…
In this paper we study reachability verification problems of stochastic discrete-time dynamical systems over the infinite time horizon. The reachability verification of interest in this paper is to certify specified lower and upper bounds…
We study the problem of persistence of attractors with smooth boundary for a class of set-valued dynamical systems that naturally arise in the context of random and control dynamical systems, as well as in systems modeling the dynamical…
In this paper, we consider the problem of distributed reachable set computation for multi-agent systems (MASs) interacting over an undirected, stationary graph. A full state-feedback control input for such MASs depends no only on the…
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…
This paper poses a theoretical characterization of the stochastic reachability problem in terms of probability measures, capturing the probability measure of the state of the system that satisfies the reachability specification for all…
The vulnerability of artificial intelligence (AI) and machine learning (ML) against adversarial disturbances and attacks significantly restricts their applicability in safety-critical systems including cyber-physical systems (CPS) equipped…
This paper describes a forward algorithm and an adjoint algorithm for computing sensitivity derivatives in chaotic dynamical systems, such as the Lorenz attractor. The algorithms compute the derivative of long time averaged "statistical"…
The term "affordance" denotes the behavioral meaning of objects. We propose a cognitive architecture for the detection of affordances in the visual modality. This model is based on the internal simulation of movement sequences. For each…
The asymptotic attractors of a nonlinear dynamical system play a key role in the long-term physically observable behaviors of the system. The study of attractors and the search for distinct types of attractor have been a central task in…
Dynamic properties of fermionic systems, like contollability, reachability, and simulability, are investigated in a general Lie-theoretical frame for quantum systems theory. Observing the parity superselection rule, we treat the fully…
We describe collective-move Monte Carlo algorithms designed to approximate the overdamped dynamics of self-assembling nanoscale components equipped with strong, short-ranged and anisotropic interactions. Conventional Monte Carlo simulations…
An account is given of the features, of the kind pertaining to q-statistics, of the dynamics at the one-dimensional critical attractors associated to the three familiar routes to chaos, intermittency, period doubling and quasiperiodicity.…
This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata…
We study the synchronization behavior of discrete-time Markov chains on countable state spaces. Representing a Markov chain in terms of a random dynamical system, which describes the collective dynamics of trajectories driven by the same…
We describe a successive convex programming (Sequential Convex Programming (SCP)) based approach for estimate the set of points where a 5-degree of freedom (5-DoF) reusable launch vehicle (RLV) returning to a landing site can transition…
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 addresses the problem of finding cycles in the state transition graphs of synchronous Boolean networks. Synchronous Boolean networks are a class of deterministic finite state machines which are used for the modeling of gene…