Related papers: A Classification of Symbolic Transition Systems
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…
Methods of *-representations in Hilbert space are applied to study of systems of $n$ subspaces in a linear space. It is proved that the problem of description of $n$-transitive subspaces in a finite-dimensional linear space is *-wild for $n…
The sets of primitive, quasiprimitive, and innately transitive permutation groups may each be regarded as the building blocks of finite transitive permutation groups, and are analogues of composition factors for abstract finite groups. This…
Semitoric systems are a special class of four-dimensional completely integrable systems where one of the first integrals generates an $\mathbb{S}^1$-action. They were classified by Pelayo & Vu Ngoc in terms of five symplectic invariants…
We formulate part V of a rigorous theory of ground states for classical, finite, Heisenberg spin systems. After recapitulating the central results of the parts I - IV previously published we extend the theory to the case where an involutary…
Controller synthesis techniques for continuous systems with respect to temporal logic specifications typically use a finite-state symbolic abstraction of the system. Constructing this abstraction for the entire system is computationally…
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive definitions are a priori parametrized by a set of inductive…
In this work we employ a simple pairing interaction model in order to study and classify an eventual pairing phase transition in finite fermionic systems. We show that systems with as few as 10-16 fermions can exhibit clear features…
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…
Free Steiner triple systems (STS) are infinite structures that are naturally characterised by a universal property. We consider the class of free STSs from a model theoretic viewpoint. We show that free STSs on any number of generators are…
In this paper we introduce four Z_2 topological indices zeta_k=0,1 at k=(0,0), (0,pi), (pi, 0), (pi, pi) characterizing 16 universal classes of 2D superconducting states that have translation symmetry but may break any other symmetries. The…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
This paper deals with input/output-to-state stability (IOSS) of continuous-time switched nonlinear systems. Given a family of systems, possibly containing unstable dynamics, and a set of restrictions on admissible switches between the…
We present a method which allows reduction of a size of a simulated system. The method can be applied to any system where one can define a finite set of possible states of the system and an elementary process which transforms one state of…
Via computer search, we found seven non-isomorphic $1$-rotational Steiner systems $S(2,6,226)$ and six point-transitive Steiner systems $S(2,6,441)$, resolving two of $29$ previously undecided cases for $S(2,6,v)$.
We consider the previously defined notion of finite-state independence and we focus specifically on normal words. We characterize finite-state independence of normal words in three different ways, using three different kinds of asynchronous…
Input-to-state stability (ISS) unifies the stability and robustness in one notion, and serves as a basis for broad areas of nonlinear control theory. In this contribution, we covered the most fundamental facts in the infinite-dimensional…
Recently Pelayo-V\~{u} Ngoc classified semitoric integrable systems in terms of five symplectic invariants. Using this classification we define a family of metrics on the space of semitoric integrable systems. The resulting metric space is…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
Input-to-state stability (ISS) allows estimating the impact of inputs and initial conditions on both the intermediate values and the asymptotic bound on the solutions. ISS has unified the input-output and Lyapunov stability theories and is…