English
Related papers

Related papers: Forward Analysis for WSTS, Part II: Complete WSTS

200 papers

This paper revisits soundness and completeness of proof systems for proving that sets of states in infinite-state labeled transition systems satisfy formulas in the modal mu-calculus. Our results rely on novel results in lattice theory,…

Logic in Computer Science · Computer Science 2023-10-04 Jeroen J. A. Keiren , Rance Cleaveland

We present high-statistics estimates of the isovector charges of the nucleon from four 2+1-flavor ensembles generated using Wilson-clover fermions with stout smearing and tree-level tadpole improved Symanzik gauge action at lattice spacings…

We show that the two dimensional Ising model is complete, in the sense that the partition function of any lattice model on any graph is equal to the partition function of the 2D Ising model with complex coupling. The latter model has all…

Quantum Physics · Physics 2013-05-30 V. Karimipour , M. H. Zarei

Recent developments of high-order CCM have been to extend existing formalism and codes to $s \ge \frac 12$ for both the ground and excited states, and independently to "generalised" expectation values for a wide range of one- and two-body…

Strongly Correlated Electrons · Physics 2010-02-24 D. J. J. Farnell

Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to…

Formal Languages and Automata Theory · Computer Science 2013-10-11 Matthew Hague

We prove that the 2D Ising model is complete in the sense that the partition function of any classical q-state spin model (on an arbitrary graph) can be expressed as a special instance of the partition function of a 2D Ising model with…

Quantum Physics · Physics 2008-03-18 M. Van den Nest , W. Dür , H. J. Briegel

We study symmetric systems with dissipative boundary conditions. The solutions of the mixed problems for such systems are given by a contraction semigroup $V(t)f = e^{tG_b}f, t \geq 0$. The solutions $u(t, x) = V(t)f$, where $f$ is an…

Mathematical Physics · Physics 2013-02-08 Vesselin Petkov

Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…

Logic in Computer Science · Computer Science 2022-07-21 Gershom Bazerman

Let $\mathcal{F} $ be a pointwise almost periodic decomposition of a compact metrizable space $X$. Then $\mathcal{F} $ is $R$-closed if and only if $\hat{\mathcal{F}} $ is usc. Moreover, if there is a finite index normal subgroup $H$ of an…

Dynamical Systems · Mathematics 2012-11-07 Tomoo Yokoyama

Pushdown Vector Addition Systems with States (PVASS) consist of finitely many control states, a pushdown stack, and a set of counters that can be incremented and decremented, but not tested for zero. Whether the reachability problem is…

Formal Languages and Automata Theory · Computer Science 2023-11-01 A. R. Balasubramanian , Rupak Majumdar , Ramanathan S. Thinniyam , Georg Zetzsche

While Bernoulli sampling is extensively studied in tensor completion, t-CUR sampling approximates low-tubal-rank tensors via lateral and horizontal subtensors. However, both methods lack sufficient flexibility for diverse practical…

Machine Learning · Computer Science 2024-06-18 Bowen Su , Juntao You , HanQin Cai , Longxiu Huang

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,…

Logic in Computer Science · Computer Science 2026-05-05 Florian Frohn , Jürgen Giesl

Vector addition system with states is an ubiquitous model of computation with extensive applications in computer science. The reachability problem for vector addition systems is central since many other problems reduce to that question. The…

Logic in Computer Science · Computer Science 2020-07-20 Jérôme Leroux , Grégoire Sutre

Many problems in computing, service, and manufacturing systems can be modeled via infinite repeating Markov chains with an infinite number of levels and a finite number of phases. Many such chains are quasi-birth-death processes (QBDs) with…

Probability · Mathematics 2015-10-13 Sherwin Doroudi , Brian Fralix , Mor Harchol-Balter

We consider time-delay systems with a finite number of delays in the state space $L^\infty\times\mathbb{R}^n$. In this framework, we show that forward completeness implies the bounded reachability sets property, while this implication was…

Optimization and Control · Mathematics 2024-03-12 Lucas Brivadis , Antoine Chaillet , Andrii Mironchenko , Fabian Wirth

We study the scattering properties of Schr\"{o}dinger operators with bounded potentials concentrated near a subspace of $\mathbb{R}^d$. For such operators, we show the existence of scattering states and characterize their orthogonal…

Mathematical Physics · Physics 2025-02-10 Adam Black , Tal Malinovitch

The wavefunction for the multiparticle Schr\"odinger equation is a function of many variables and satisfies an antisymmetry condition, so it is natural to approximate it as a sum of Slater determinants. Many current methods do so, but they…

Mathematical Physics · Physics 2009-11-13 Gregory Beylkin , Martin J. Mohlenkamp , Fernando Pérez

We introduce a class of states of a composite quantum system, the so-called cross states, that turn out to play a major role in the theory of entanglement for a genuinely infinite-dimensional bipartite system. In the case where at least one…

Mathematical Physics · Physics 2026-02-23 Paolo Aniello

We investigate the critical behavior of the two-dimensional spin-$1$ Baxter-Wu model in the presence of a crystal-field coupling $\Delta$ with the goal of determining the universality class of transitions along the second-order part of the…

Statistical Mechanics · Physics 2023-08-28 A. R. S. Macedo , A. Vasilopoulos , M. Akritidis , J. A. Plascak , N. G. Fytas , M. Weigel

We study the theory of safety and liveness in a reversible calculus where reductions are totally ordered and rollbacks lead the systems to past states. Similar to previous work on communicating transactions, liveness and safety respectively…

Logic in Computer Science · Computer Science 2016-08-01 Claudio Antares Mezzina , Vasileios Koutavas