Related papers: Well Behaved Transition Systems
Preparation of pure states on networks of quantum systems by controlled dissipative dynamics offers important advantages with respect to circuit-based schemes. Unlike in continuous-time scenarios, when discrete-time dynamics are considered,…
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic has to be expressive enough to allow the formalization of…
In this article we propose a Weighted Stochastic Mesh (WSM) Algorithm for approximating the value of a discrete and continuous time optimal stopping problem. We prove that in the discrete case the WSM algorithm leads to semi-tractability of…
The robustness of topological properties, such as quantized currents, generally depends on the existence of gaps surrounding the relevant energy levels or on symmetry-forbidden transitions. Here, we observe quantized currents that survive…
This paper establishes alternative characterizations of very expressive classes of existential rule sets with decidable query entailment. We consider the notable class of greedy bounded-treewidth sets (gbts) and a new, generalized variant,…
This paper proposes several definitions of robust stability for logic dynamical systems (LDSs) with uncertain switching, including robust/uniform robust set stability and asymptotical (or infinitely convergent)/finite-time set stability…
Time-Sensitive Distributed Systems (TSDS), such as applications using autonomous drones, achieve goals under possible environment interference (\eg, winds). Moreover, goals are often specified using explicit time constraints which must be…
In a recent article, we introduced and studied a precise class of dynamical systems called solvable systems. These systems present a dynamic ruled by discontinuous ordinary differential equations with solvable right-hand terms and unique…
The study of resonances (and well-posedness) for complex systems under time-periodic loading is of broad interest in application. The work of Galdi et al.~(2014) connects asymptotic stability of solutions to an unforced Cauchy problem to…
A frequently desirable characteristic of chemical kinetics systems is that of persistence, the property that if all the species are initially present then none of them may tend toward extinction. It is known that solutions of…
Uncertain information is commonplace in real-world data management scenarios. The ability to represent large sets of possible instances (worlds) while supporting efficient storage and processing is an important challenge in this context.…
The well-quasi-orders (WQO) play an important role in various fields such as Computer Science, Logic or Graph Theory. Since the class of WQOs lacks closure under some important operations, the proof that a certain quasi-order is WQO…
The elapsed time equation is an age-structured model that describes the dynamics of interconnected spiking neurons through the elapsed time since the last discharge, leading to many interesting questions on the evolution of the system from…
We study the transport properties of nonautonomous chaotic dynamical systems over a finite time duration. We are particularly interested in those regions that remain coherent and relatively non-dispersive over finite periods of time,…
Can we conclude the stability of an unknown dynamical system from the knowledge of a finite number of snapshots of trajectories? We tackle this black-box problem for switched linear systems. We show that, for any given random set of…
In the paper we present results to develop an irreducible theory of complex systems in terms of self-organization processes of prime integer relations. Based on the integers and controlled by arithmetic only the self-organization processes…
Inspired by quantum switches, we consider a discrete-time multi-way matching system with two classes of arrivals: requests for entangled pair of qubits between two nodes, and qubits from each node that can be used to serve the requests. An…
In quenched disordered systems, the existence of ordering is generally believed to be only possible in the weak disorder regime (disregarding models of spin-glass type). In particular, sufficiently large random fields is expected to…
In [ABM07], Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems…
Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph…