Related papers: A Classification of Symbolic Transition Systems
We study transitivity properties of graphs with more than one end. We completely classify the distance-transitive such graphs and, for all $k \geq 3$, the $k$-CS-transitive such graphs.
We introduce a class of states so-called semi-SSPPT (semi super strong positive partial transposition) states in infinite-dimensional bipartite systems by the Cholesky decomposition in terms of operator matrices and show that every…
We propose a definition of the category of hybrid systems in which executions are special types of morphisms. Consequently morphisms of hybrid systems send executions to executions. We plan to use this result to define and study networks of…
We present a variety of results analyzing the behavior of a class of stochastic processes --- referred to as Stochastic Hybrid Systems (SHSs) --- in or near equilibrium, and determine general conditions on when the moments of the process…
We obtain the formula computing the number of isomorphic classes of element systems with characters over finite commutative group $G$.
A possible phase in short-range spin glasses exhibiting infinitely many equilibrium states is proposed and characterized in real space. Experimental signatures in equilibrating systems measured with scanning probes are discussed. Some…
The smallest open case for classifying Steiner triple systems is order 21. A Steiner triple system of order 21, an STS(21), can have subsystems of orders 7 and 9, and it is known that there are 12,661,527,336 isomorphism classes of STS(21)s…
We investigate certain classes of integrable classical or quantum spin systems. The first class is characterized by the recursively defined property $P$ saying that the spin system consists of a single spin or can be decomposed into two…
Labeled transition systems are typically used to represent the behavior of nondeterministic processes, with labeled transitions defining a one-step state to-state reachability relation. This model has been recently made more general by…
We propose a new approach for proving safety of infinite state systems. It extends the analyzed system by transitive relations until its diameter D becomes finite, i.e., until constantly many steps suffice to cover all reachable states,…
In this paper, we propose several opacity-preserving (bi)simulation relations for general nondeterministic transition systems (NTS) in terms of initial-state opacity, current-state opacity, K-step opacity, and infinite-step opacity. We also…
This article deals with input-to-state stability (ISS) of continuous-time switched nonlinear systems. Given a family of systems with exogenous inputs such that not all systems in the family are ISS, we characterize a new and general class…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
In this paper we define a class of state-sum invariants of compact closed oriented piece-wise linear 4-manifolds using finite groups. The definition of these state-sums follows from the general abstract construction of 4-manifold invariants…
If a partition of a lattice in R^d is selfsimilar, it is called lattice substitution system (LSS). Such sets represent nonperiodic, but highly ordered structures. An important property of such structures is, whether they are model sets or…
We study $S(t-1,t,2t)$, which is a special class of Steiner systems. Explicit constructions for designing such systems are developed under a graph-theoretic platform where Steiner systems are represented in the form of uniform hypergraphs.…
A subgroup $H$ of a finite group $G$ is said to be SS-permutable in $G$ if $H$ has a supplement $K$ in $G$ such that $H$ permutes with every Sylow subgroup of $K$. A finite group $G$ is called an SST-group if SS-permutability is a…
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…
We revisit the complexity of procedures on SFAs (such as intersection, emptiness, etc.) and analyze them according to the measures we find suitable for symbolic automata: the number of states, the maximal number of transitions exiting a…
We characterise all vertex-transitive finite connected graphs as essentially 5-connected or on a short list of explicit graph-classes. Our proof heavily uses Tutte-type canonical decompositions.