Related papers: Domination and Multistate Systems
The standard engineering approach to modelling of complex systems is highly compositional. In order to be able to understand (or to control) the behavior of a complex dynamical systems, it is often desirable, if not necessary, to view this…
Ordered binary decision diagrams (OBDDs) are a fundamental data structure for the manipulation of Boolean functions, with strong applications to finite-state symbolic model checking. OBDDs allow for efficient algorithms using top-down…
We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota's theory of M\"obius inversion. The technique works for a large class of semigroups including: inverse…
The voter model is a paradigm of ordering dynamics. At each time step, a random node is selected and copies the state of one of its neighbors. Traditionally, this state has been considered as a binary variable. Here, we relax this…
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute a finite representation of the set of successors of the…
Domain operations on semirings have been axiomatised in two different ways: by a map from an additively idempotent semiring into a boolean subalgebra of the semiring bounded by the additive and multiplicative unit of the semiring, or by an…
In this brief note, we investigate some constructions of Lyapunov functions for stochastic discrete-time stabilizable dynamical systems, in other words, controlled Markov chains. The main question here is whether a Lyapunov function in some…
The domination multisubdivision number of a nonempty graph $G$ was defined as the minimum positive integer $k$ such that there exists an edge which must be subdivided $k$ times to increase the domination number of $G$. Similarly we define…
Signed networks provide a principled framework for representing systems in which interactions are not merely present or absent but qualitatively distinct: friendly or antagonistic, supportive or conflicting, excitatory or inhibitory. This…
This paper addresses a large class of vector optimization problems in infinite-dimensional spaces with respect to two important binary relations derived from domination structures. Motivated by theoretical challenges as well as by…
In~\cite{algorithmic} was given an algorithm that computes arithmetical structures on matrices. We use some of the ideas contained there to get an algorithm that computes arithmetical structures over dominated polynomials. A dominated…
Multimodular functions, primarily used in the literature of queueing theory, discrete-event systems, and operations research, constitute a fundamental function class in discrete convex analysis. The objective of this paper is to clarify the…
We study how iterated convolutions of probability measures compare under stochastic domination. We give necessary and sufficient conditions for the existence of an integer $n$ such that $\mu^{*n}$ is stochastically dominated by $\nu^{*n}$…
Recently, Benini et al. showed that, in simply connected wandering domains of entire functions, all pairs of orbits behave in the same way relative to the hyperbolic metric, thus giving us our first insight into the general internal…
In this study, we propose the sublinear expectation structure under countable state space. To describe an interesting "nonlinear randomized" trial, based on a convex compact domain, we introduce a family of probability measures under…
We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
This paper introduces and analyzes symmetric and anti-symmetric quantum binary functions. Generally, such functions uniquely convert a given computational basis state into a different basis state, but with either a plus or a minus sign.…
The reachability analysis of weighted pushdown systems is a very powerful technique in verification and analysis of recursive programs. Each transition rule of a weighted pushdown system is associated with an element of a bounded semiring…
We introduce the notions of semi-uniform input-to-state stability and its subclass, polynomial input-to-state stability, for infinite-dimensional systems. We establish a characterization of semi-uniform input-to-state stability based on…