• Aucun résultat trouvé

Complexity of ten decision problems in continuous time dynamical systems

N/A
N/A
Protected

Academic year: 2021

Partager "Complexity of ten decision problems in continuous time dynamical systems"

Copied!
7
0
0

Texte intégral

Loading

Références

Documents relatifs

This is encouraging as these results suggest that block-sparse bolasso method allows to obtain surrogate optimal control problems (4) as close to the original problems (2) as

An assume-guarantee contract is a compositional tool that specifies how a system behaves under assumptions about its inputs [6]. The use of assume-guarantee con- tracts makes

Durand, Linearly recurrent subshifts have a finite number of non-periodic subshift factors, Ergodic Theory and Dynamical Systems 20 (2000), 1061-1078..

We investigate a system of two coupled modes, only one of them interacting with external degrees of freedom, represented, in the first case, by a finite number of harmonic

The aim of this paper is to reduce decision complexity in production network configu- ration and to shift the design process from a site oriented view towards a stronger focus on

On the other hand, reachability from a given initial state x i and full reachability are, in general, not equivalent for nonlinear dynamical systems, as shown by the

Dynamic dependence structures among the occurrence of different types of events in continuous time can be represented by local independence graphs as de- veloped by Didelez (2006,

Both the topological and measure-theoretic theory are just nascent, and raise two kind of questions inspired by the symbolic theory: we would like to build examples showing what kind