Related papers: Constructing (Bi)Similar Finite State Abstractions…
In concurrency theory, weak bisimilarity is often used to relate processes exhibiting the same observable behaviour. The probabilistic environment gives rise to several generalisations; we study the infinitary semantics, which abstracts…
I propose a discrete synchronization model of finite d-level systems and discuss what happens once superposition of states is allowed. The model exhibits various asymptotic behaviors that depend on the initial state. In particular, two…
We study the relationship between the partially synchronous state and the coupling structure in general dynamical systems. Our results show that, on the contrary to the widely accepted concept, topological symmetry in a coupling structure…
Full Multiple Spawning offers an in principle exact framework for excited-state dynamics, where nuclear wavefunctions in different electronic states are represented by a set of coupled trajectory basis functions that follow classical…
In this work, we derive conditions under which abstractions of networks of stochastic hybrid systems can be constructed compositionally. Proposed conditions leverage the interconnection topology, switching randomly between P different…
Convergence properties of model-free two-timescale asymptotic simulations of singularly perturbed hybrid inclusions are developed. A hybrid inclusion combines constrained differential and difference inclusions to capture continuous (flow)…
There are several known constructions of equilibrium states for H\"older continuous potentials in the context of both subshifts of finite type and uniformly hyperbolic systems. In this article we present another method of building such…
Equations governing the nonlinear dynamics of complex systems are usually unknown and indirect methods are used to reconstruct their manifolds. In turn, they depend on embedding parameters requiring other methods and long temporal sequences…
In a deterministic world, a planning agent can be certain of the consequences of its planned sequence of actions. Not so, however, in dynamic, stochastic domains where Markov decision processes are commonly used. Unfortunately these suffer…
The main purpose of thispaper is to show that composite quantum-like (QL) systems can closely mimic the separable states of quantum systems, and that suitable physical systems exhibiting these states exist. It is shown that QL graphs can…
The asynchronous systems are non-deterministic real time, binary valued models of the asynchronous circuits from electronics. Autonomy means that there is no input and regularity means analogies with the (real) dynamical systems. We…
We establish a separation principle for the output feedback stabilisation of state-affine systems that are observable at the stabilization target. Relying on control templates (recently introduced in [4]), that allow to approximate a…
We characterize synchronization phenomenon in discrete-time, discrete-state random dynamical systems, with random and probabilistic Boolean networks as particular examples. In terms of multiplicative ergodic properties of the induced linear…
We study two coupled discrete-time equations with different (asynchronous) periodic time scales. The coupling is of the type sample and hold, i.e., the state of each equation is sampled at its update times and held until it is read as an…
The technique of abstracting abstract machines (AAM) provides a systematic approach for deriving computable approximations of evaluators that are easily proved sound. This article contributes a complementary step-by-step process for…
The quantum de Finetti theorem says that, given a symmetric state, the state obtained by tracing out some of its subsystems approximates a convex sum of power states. The more subsystems are traced out, the better this approximation…
This study aims at finding a method for constructing molecular dynamics like models using the formalism of cellular automata for fast simulation of fluid dynamic systems (including compressible phenomena). In as much as the results…
Automating the derivation of published results is a challenge, in part due to the informal use of mathematics by physicists, compared to that of mathematicians. Following demand, we describe a method for converting informal hand-written…
We consider the problem of approximating discrete-time plants with finite-valued sensors and actu- ators by deterministic finite memory systems for the purpose of certified-by-design controller synthesis. Building on ideas from robust…
This paper introduces a new behavioral system model with distinct external and internal signals possibly evolving on different time scales. This allows to capture abstraction processes or signal aggregation in the context of control and…