相关论文: Classes of states of discrete systems

Sufficiently accurate finite state models, also called symbolic models or discrete abstractions, allow one to apply fully automated methods, originally developed for purely discrete systems, to formally reason about continuous and hybrid…

Time-discrete dynamical systems on a finite state space have been used with great success to model natural and engineered systems such as biological networks, social networks, and engineered control systems. They have the advantage of being…

We present a procedure for reducing the number of continuous states of discrete-time linear switched systems, such that the reduced system has the same behavior as the original system for a subset of switching sequences. The proposed method…

Finite-state models of control systems were proposed by several researchers as a convenient mechanism to synthesize controllers enforcing complex specifications. Most techniques for the construction of such symbolic models have two main…

In a recent article [Phys. Rev. Lett. 97 (2006), 107206], we have presented a class of states which is suitable as a variational set to find ground states in spin systems of arbitrary spatial dimension and with long-range entanglement.…

Simulation has become the evaluation method of choice for many areas of distributing computing research. However, most existing simulation packages have several limitations on the size and complexity of the system being modeled. Fine…

We present an approach for the semiclassical treatment of open quantum systems. An expansion into localized states allows restriction of a simulation to a fraction of the environment that is located within a predefined vicinity of the…

We review and extend, in a self-contained way, the mathematical foundations of numerical simulation methods that are based on the use of random states. The power and versatility of this simulation technology is illustrated by calculations…

To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…

The reduction of dynamical systems has a rich history, with many important applications related to stability, control and verification. Reduction of nonlinear systems is typically performed in an exact manner - as is the case with…

Weighted graph states are a natural generalization of graph states, which are generated by applying controlled-phase gates, instead of controlled-Z gates, to a separable state. In this paper, we show that uniformly weighted graph states on…

Biochemical reaction systems may be viewed as discrete event processes characterized by a number of states and state transitions. These systems may be modeled as state transition systems with transitions representing individual reaction…

The conventional spin dynamics simulations are performed in direct products of state spaces of individual spins. In a general system of n spins, the total number of elements in the state basis is >4^n. A system propagation step requires an…

Partial differential equation-based numerical solution frameworks for initial and boundary value problems have attained a high degree of complexity. Applied to a wide range of physics with the ultimate goal of enabling engineering…

We consider reduction of dimension for nonlinear dynamical systems. We demonstrate that in some cases, one can reduce a nonlinear system of equations into a single equation for one of the state variables, and this can be useful for…

We revisit the problem of computing (robust) controlled invariant sets for discrete-time linear systems. Departing from previous approaches, we consider implicit, rather than explicit, representations for controlled invariant sets.…

Weakly nonlinear degrees of freedom in dissipative quantum systems tend to localize near manifolds of quasi-classical states. We present a family of analytical and computational methods for deriving optimal unitary model transformations…

In this paper we consider complex dynamical networks modeled by means of state space systems running in discrete time. We assume that the dependency structure of the variables within the (nonlinear) network equations is known and use…

We present a method of parameter estimation for large class of nonlinear systems, namely those in which the state consists of output derivatives and the flow is linear in the parameter. The method, which solves for the unknown parameter by…

Like [1], we present an algorithm to compute the simulation of a query pattern in a graph of labeled nodes and unlabeled edges. However, our algorithm works on a compressed graph grammar, instead of on the original graph. The speed-up of…