Related papers: Well Behaved Transition Systems
Parameterized verification of coverability in broadcast networks with finite state processes has been studied for different types of models and topologies. In this paper, we attempt to develop a theory of broadcast networks in which the…
The dynamical behavior of switched affine systems is known to be more intricate than that of the well-studied switched linear systems, essentially due to the existence of distinct equilibrium points for each subsystem. First, under…
It is well known that \omega-limit sets are internally chain transitive and have weak incompressibility; the converse is not generally true, in either case. However, it has been shown that a set is weakly incompressible if and only if it is…
In this work, we give sufficient conditions for the almost global asymptotic stability of a cascade in which the subsystems are only almost globally asymptotically stable. The result is extended to upper triangular systems of arbitrary…
The study of intelligent systems explains behaviour in terms of economic rationality. This results in an optimization principle involving a function or utility, which states that the system will evolve until the configuration of maximum…
We regard the Cauchy problem for a particular Whitham-Boussinesq system modelling surface waves of an inviscid incompressible fluid layer. The system can be seen as a weak nonlocal dispersive perturbation of the shallow water system. The…
Stochastic port-Hamiltonian systems on infinite-dimensional spaces governed by It\^o stochastic differential equations (SDEs) are introduced and some properties of this new class of systems are studied. They are an extension of stochastic…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
Intuitively, if we can prove that a program terminates, we expect some conclusion regarding its complexity. But the passage from termination proofs to complexity bounds is not always clear. In this work we consider Monotonicity Constraint…
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
The Quasi Steady-State (QSS) model of long-term dynamics relies on the idea of time-scale decomposition. Assuming that the fast variables are infinitely fast and are stable in the long-term, the QSS model replaces the differential equations…
Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well-founded,…
In this paper, we give easily verifiable sufficient conditions for two classes of perturbed linear, passive PDE systems to be well-posed, and we provide an energy inequality for the perturbed systems. Our conditions are in terms of…
We introduce the quasiminimal subshifts, subshifts having only finitely many subsystems. With $\mathbb{N}$-actions, their theory essentially reduces to the theory of minimal systems, but with $\mathbb{Z}$-actions, the class is much larger.…
Mixed-monotone systems are separable via a decomposition function into increasing and decreasing components, and this decomposition function allows for embedding the system dynamics in a higher-order monotone embedding system. Embedding the…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
We study quasi-convex optimization problems, where only a subset of the constraints can be sampled, and yet one would like a probabilistic guarantee on the obtained solution with respect to the initial (unknown) optimization problem. Even…
Modelling complex information systems often entails the need for dealing with scenarios of inconsistency in which several requirements either reinforce or contradict each other. In this kind of scenarios, arising e.g. in knowledge…
Let (X,T) be a topologically transitive dynamical system. We show that if there is a subsystem (Y,T) of (X,T) such that (X\times Y, T\times T) is transitive, then (X,T) is strongly chaotic in the sense of Li and Yorke. We then show that…
We consider the decidability of state-to-state reachability in linear time-invariant control systems over continuous time. We analyse this problem with respect to the allowable control sets, which are assumed to be the image under a linear…