• Aucun résultat trouvé

Reachability in Dynamical Systems with Rounding

N/A
N/A
Protected

Academic year: 2021

Partager "Reachability in Dynamical Systems with Rounding"

Copied!
18
0
0

Texte intégral

Loading

Figure

Figure 1 Decidability and complexity table for the Rounded P2P Problem.
Figure 2 State diagram for φ whilst considering dimension k−1, assuming k is just rotating.
Figure 3 Example where the system may become large before being periodic (see Example 18).

Références

Documents relatifs

Subsequent work has revealed dynamical features found in smooth systems, as well as special features of the model, such as the dynam- ics close to grazing impact (see Nordmark

Another noteworthy result tied to associativity is that systems generated by a single connective are always polynomially as efficient as any system generated by two or more

Abstract — This paper gives the sufficient and necessary conditions to guarantee the existence of a linear change of co- ordinates to transform a multi-output linear dynamical

In the case when σ = enf (τ ), the equivalence classes at type σ will not be larger than their original classes at τ , since the main effect of the reduction to exp-log normal form

• To propose a direct and “elementary” proof of the main result of [3], namely that the semi-classical spectrum near a global minimum of the classical Hamiltonian determines the

chosen that it remains simply normal to base 2 but a* has given lower and upper asymptotic digit frequencies, subjet only to the condition.. which is prompted by

We generalize this result by considering a symmetric matrix M with en- tries in a formally real principal domain A , we assume that M is positive semi-definite for any ordering on

For some insight into behavioral strategies (and their variants) in connection with the model that we deal with in this paper, let us begin by referring to the formulation of