Related papers: Forward Analysis for WSTS, Part II: Complete WSTS
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 develop a systematic cluster expansion for dilute systems in the highly dilute phase. We first apply it to the calculation of the entropy of the K-satisfiability problem in the satisfiable phase. We derive a series expansion in the…
Nested counter systems (NCS) are a generalization of counter systems to higher-order counters. Here, a higher-order counter is allowed to have other (lower-order) counters as elements, instead of just a number. Such systems can be viewed as…
We settle the complexity of satisfiability, finite-state satisfiability, and model-checking for several fragments of second-order HyperLTL, which extends HyperLTL with quantification over sets of traces: they are all in the analytical…
In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose…
Analytical solutions for the surface state (SS) of an extended Wolff Hamiltonian, which is a common Hamiltonian for strongly spin-orbit coupled systems, are obtained both for semi-infinite and finite-thickness boundary conditions. For the…
Backward reachability analysis computes the set of states that reach a target set under the competing influence of control input and disturbances. Depending on their interplay, the backward reachable set either represents all states that…
Neural Networks (NNs) can provide major empirical performance improvements for robotic systems, but they also introduce challenges in formally analyzing those systems' safety properties. In particular, this work focuses on estimating the…
We study the size and the complexity of computing finite state automata (FSA) representing and approximating the downward and the upward closure of Petri net languages with coverability as the acceptance condition. We show how to construct…
We construct an isometric modified scattering operator, mapping any sufficiently regular past scattering state, with a small distribution function, to the future one corresponding to forward evolution by the Vlasov-Maxwell system. The main…
We prove a converse Lyapunov theorem for boundedness of reachability sets for a general class of control systems whose flow is Lipschitz continuous on compact intervals with respect to trajectory-dominated inputs. We show that this…
We introduce COLOSS, a program designed to address the scattering problem using a bound-state technique known as complex scaling. In this method, the oscillatory boundary conditions of the wave function are transformed into exponentially…
We introduce a technique for reachability analysis of Time-Basic (TB) Petri nets, a powerful formalism for real- time systems where time constraints are expressed as intervals, representing possible transition firing times, whose bounds are…
The simplest condition characterizing quasi-finite CW complexes $K$ is the implication $X\tau_h K\implies \beta(X)\tau K$ for all paracompact spaces $X$. Here are the main results of the paper: Theorem: If $\{K_s\}_{s\in S}$ is a family of…
In this work, we study the transmission properties of one dimensional finite periodic systems with $\mathcal{PT}$-symmetry. A simple closed form expression is obtained for the total transmittance from a lattice of N cells, that allows us to…
We introduce the process calculus Multi-CCS, which extends conservatively CCS with an operator of strong prefixing able to model atomic sequences of actions as well as multiparty synchronization. Multi-CCS is equipped with a labeled…
The Fourier-transform scanning tunneling spectroscopy (FTSTS) contains rich signals related to the quasiparticle scattering interference and/or the density-wave-like orders which are crucial in interpretation of the ground states and the…
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
We study systems of coupled spin-gapped and gapless Luttinger liquids. First, we establish the existence of a sliding Luttinger liquid phase for a system of weakly coupled parallel quantum wires, with and without disorder. It is shown that…
Let L be a countable and locally finite CW complex. Suppose that the class of all metrizable compacta of extension dimension not greater than L contains a universal element which is an absolute extensor in dimension L. Our main result shows…