Related papers: Constructing (Bi)Similar Finite State Abstractions…
We present a numerical study of a two-lane version of the stochastic non-equilibrium model known as the totally asymmetric simple exclusion process. For such a system with open boundaries, and suitably chosen values of externally-imposed…
A key question that arises in rigorous analysis of cyberphysical systems under attack involves establishing whether or not the attacked system deviates significantly from the ideal allowed behavior. This is the problem of deciding whether…
We explore in this paper a novel approach that builds an overapproximation of the state space of preemptive real time systems. Our graph construction extends the expression of a class to the time distance system that encodes the…
While the difficulty of reinforcement learning problems is typically related to the complexity of their state spaces, Abstraction proposes that solutions often lie in simpler underlying latent spaces. Prior works have focused on learning…
This paper establishes absolute stability conditions for nonlinear negative imaginary (NI) systems interconnected with static nonlinear feedback. We first show that the NI property is preserved when the feedback nonlinearity can be…
We present two frameworks for structure-preserving model order reduction of interconnected subsystems, improving tractability of the reduction methods while ensuring stability and accuracy bounds of the reduced interconnected model. Instead…
This paper provides a state feedback stabilization approach for nonlinear systems of relative degree less than or equal to two by rendering them nonlinear negative imaginary (NI) systems. Conditions are provided under which a nonlinear…
Self-similar, spherically symmetric cosmological models with a perfect fluid and a scalar field with an exponential potential are investigated. New variables are defined which lead to a compact state space, and dynamical systems methods are…
We describe a framework for using natural language to design state abstractions for imitation learning. Generalizable policy learning in high-dimensional observation spaces is facilitated by well-designed state representations, which can…
The review presents the development of an approach of constructing approximate solutions to complicated physics problems, starting from asymptotic series, through optimized perturbation theory, to self-similar approximation theory. The…
Given two arbitrary pure states $ |\phi>$ and $ |\psi>$ of qubits or higher level states, we provide arguments in favor of states of the form $ \frac{1}{\sqrt{2}}(|\psi> |\phi> + i |\phi> |\psi>) $ instead of symmetric or anti-symmetric…
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…
In a previous paper the authors applied the Abstract Interpretation approach for approximating the probabilistic semantics of biological systems, modeled specifically using the Chemical Ground Form calculus. The methodology is based on the…
Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…
In this paper, we extend the notion of finite-time input-to-state stability (FTISS) for finite-dimensional systems to infinite-dimensional systems. More specifically, we first prove an FTISS Lyapunov theorem for a class of…
This paper introduces a general approach for synthesizing procedural models of the state-transitions of a given discrete system. The approach is general in that it accepts different target languages for modeling the state-transitions of a…
In this paper we present the extension of an existing method for abstract graph-based state space exploration, called neighbourhood abstraction, with a reduction technique based on subsumption. Basically, one abstract state subsumes another…
The asynchronous systems are the non-deterministic models of the asynchronous circuits from the digital electrical engineering. In the autonomous version, such a system is a set of functions x:R{\to}{0,1}^{n} called states (R is the time…
Synthesizing programs from examples requires searching over a vast, combinatorial space of possible programs. In this search process, a key challenge is representing the behavior of a partially written program before it can be executed, to…
A complete set of Feynman rules is derived, which permits a perturbative description of the nonequilibrium dynamics of a symmetry-breaking phase transition in $\lambda\phi^4$ theory in an expanding universe. In contrast to a naive expansion…