English
Related papers

Related papers: Well Behaved Transition Systems

200 papers

Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…

Computational Complexity · Computer Science 2024-02-08 Manon Blanc , Olivier Bournez

Long lived quasi-stationary states (QSSs) are a signature characteristic of long-range interacting systems both in the classical and in the quantum realms. Often, they emerge after a sudden quench of the Hamiltonian internal parameters and…

Quantum Physics · Physics 2021-08-20 Nicolò Defenu

We consider logistic networks in which the control and disturbance inputs take values in finite sets. We derive a necessary and sufficient condition for the existence of robustly control invariant (hyperbox) sets. We show that a stronger…

Optimization and Control · Mathematics 2014-04-22 Danielle C. Tarraf , Dario Bauso

Metastability is a physical phenomenon ubiquitous in first order phase transitions. A fruitful mathematical way to approach this phenomenon is the study of rare transitions Markov chains. For Metropolis chains associated with Statistical…

Probability · Mathematics 2015-09-30 Emilio Cirillo , Francesca Nardi , Julien Sohier

Stability is an important issue in order to characterize the performance of a network, and it has become a major topic of study in the last decade. Roughly speaking, a communication network system is said to be stable if the number of…

Networking and Internet Architecture · Computer Science 2020-05-06 Vicent Cholvi , Paweł Garncarek , Tomasz Jurdzinski , Dariusz R. Kowalski

The sequential compactness afforded hybrid systems under mild regularity constraints guarantee outer/upper semicontinuous dependence of solutions on initial conditions and perturbations. For reachable sets of hybrid systems, this property…

Optimization and Control · Mathematics 2022-10-18 Berk Altın , Ricardo G. Sanfelice

We consider the problem of learning a non-deterministic probabilistic system consistent with a given finite set of positive and negative tree samples. Consistency is defined with respect to strong simulation conformance. We propose learning…

Logic in Computer Science · Computer Science 2012-07-24 Anvesh Komuravelli , Corina S. Pasareanu , Edmund M. Clarke

This paper tackles the problem of the existence of solutions for recursive systems of Horn clauses with second-order variables interpreted as integer relations, and harnessed by quantifier-free difference bounds arithmetic. We start by…

Formal Languages and Automata Theory · Computer Science 2016-02-16 Radu Iosif

We consider the posets of equivalence relations on finite sets under the standard embedding ordering and under the consecutive embedding ordering. In the latter case, the relations are also assumed to have an underlying linear order, which…

Combinatorics · Mathematics 2024-02-12 V. Ironmonger , N. Ruskuc

It is rigorously proved that quasilinear impulsive systems possess unpredictable solutions when a perturbation generated by an unpredictable sequence is applied. The existence, uniqueness, as well as asymptotic stability of such solutions…

Dynamical Systems · Mathematics 2021-11-03 Mehmet Onur Fen , Fatma Tokmak Fen

The best developed formulation of closed system quantum theory that handles multiple-time statements, is the consistent (or decoherent) histories approach. The most important weaknesses of the approach is that it gives rise to many…

Quantum Physics · Physics 2014-10-14 Petros Wallden

We introduce a variant of transition systems, where activation of transitions depends on conditions of the environment and upgrades during runtime potentially create additional transitions. Using a cornerstone result in lattice theory, we…

Software Engineering · Computer Science 2017-06-09 Harsh Beohar , Barbara König , Sebastian Küpper , Alexandra Silva

Quasistationary states are long-lived nonequilibrium states, observed in some systems with long-range interactions under deterministic Hamiltonian evolution. These intriguing non-Boltzmann states relax to equilibrium over times which…

Statistical Mechanics · Physics 2015-03-17 Shamik Gupta , David Mukamel

One of the basic properties of a queueing network is stability. Roughly speaking, it is the property that the total number of jobs in the network remains bounded as a function of time. One of the key questions related to the stability issue…

Probability · Mathematics 2009-11-19 David Gamarnik , Dmitriy Katz

This paper develops sharp Hautus-type criteria, stochastic counterparts of the classical Popov-Belevitch-Hautus test, for exact controllability and stabilizability of backwardstructured stochastic linear systems. The main finding is that…

Optimization and Control · Mathematics 2026-05-28 Jingrui Sun

We study the chaos of travelling waves (TW) in unidirectional chains of bistable maps. Previous numerical results suggested that this property is selective, {\sl viz.}\ given the parameters, there is at most a single (non-trivial) velocity…

Cellular Automata and Lattice Gases · Physics 2018-11-21 Bastien Fernandez

This paper derives two stabilizability theorems for a basic class of discrete-time nonlinear systems with multiple unknown parameters. First, we claim that a discrete-time multi-parameter system is stabilizable if its nonlinear growth rate…

Optimization and Control · Mathematics 2020-07-23 Zhaobo Liu , Chanying Li

It has recently been shown that fairly strong axiom systems such as $\mathsf{ACA}_0$ cannot prove that the antichain with three elements is a better quasi order ($\mathsf{bqo}$). In the present paper, we give a complete characterization of…

Logic · Mathematics 2023-05-03 Anton Freund , Alberto Marcone , Fedor Pakhomov , Giovanni Soldà

Motivated by a real problem in steel production, we introduce and analyze a general class of singularly perturbed linear hybrid systems with both switches and impulses, in which the slow or fast nature of the variables can be…

Systems and Control · Computer Science 2017-06-16 Jihene Ben Rejeb , Irinel-Constantin Morărescu , Antoine Girard , Jamal Daafouz

The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…

Logic in Computer Science · Computer Science 2024-02-15 Jakub Rydval , Žaneta Semanišinová , Michał Wrona