相关论文: Forward Analysis for WSTS, Part II: Complete WSTS

This paper develops a Multiset Rewriting language with explicit time for the specification and analysis of Time-Sensitive Distributed Systems (TSDS). Goals are often specified using explicit time constraints. A good trace is an infinite…

In this paper, we proposed an procedure to construct the completion of the integrable system by adding a perturbation to the generalized matrix problem, which can be used to continuous integrable couplings, discrete integrable couplings and…

This paper examines the consistency of w-order by means of a supertask that functions as a supertrap for the assumed existence of w-ordered collections, which are simultaneously complete (as is required by the Actual infinity) and…

Counter systems are a well-known and powerful modeling notation for specifying infinite-state systems. In this paper we target the problem of checking temporal properties of counter systems. We first focus on checking liveness properties…

Neural Networks (NNs) can provide major empirical performance improvements for closed-loop systems, but they also introduce challenges in formally analyzing those systems' safety properties. In particular, this work focuses on estimating…

We present a finite-element approach for computing the aggregate scattering matrix of a network of linear coherent scatterers. These might be optical scatterers or more general scattering coins studied in quantum walk theory. While…

We consider continuous-time Markov chains which display a family of wells at the same depth. We provide sufficient conditions which entail the convergence of the finite-dimensional distributions of the order parameter to the ones of a…

A decade ago, Abdulla, Ben Henda and Mayr introduced the elegant concept of decisiveness for denumerable Markov chains [1]. Roughly speaking, decisiveness allows one to lift most good properties from finite Markov chains to denumerable…

The coverability problem for Petri nets plays a central role in the verification of concurrent shared-memory programs. However, its high EXPSPACE-complete complexity poses a challenge when encountered in real-world instances. In this paper,…

Unlike matrix completion, tensor completion does not have an algorithm that is known to achieve the information-theoretic sample complexity rate. This paper develops a new algorithm for the special case of completion for nonnegative…

Many applications from the financial industry successfully leverage clustering algorithms to reveal meaningful patterns among a vast amount of unstructured financial data. However, these algorithms suffer from a lack of interpretability…

The aim of this work is to derive sharp quantitative estimates of the qualitative convergence results developed in [28] for regularized full- and partial-cloaks via the transformation-optics approach. Let $\Gamma_0$ be a compact set in…

Finite-size scaling (FSS) for a critical phase transition ($t=0$) states that within a window of size $|t|\sim L^{-1/\nu}$, the scaling behavior of any observable $Q$ in a system of linear size $L$ asymptotically follows a scaling form as…

We study several decision problems for counter systems with guards defined by convex polyhedra and updates defined by affine transformations. In general, the reachability problem is undecidable for such systems. Decidability can be achieved…

In this note we introduce the concept of a quasi-finite complex. Next, we show that for a given countable and locally finite CW complex L the following conditions are equivalent: (i) L is quasi-finite. (ii) There exists a [L]-invertible…

A random field $X = (X_v)_{v \in G}$ on a quasi-transitive graph $G$ is a factor of i.i.d. if it can be written as $X=\varphi(Y)$ for some i.i.d. process $Y= (Y_v)_{v \in G}$ and equivariant map $\varphi$. Such a map, also called a coding,…

We provide a new method to construct the S-matrix in quantum field theory. This method implements crossing symmetry manifestly by erasing the a priori distinction between in- and out-states. It allows the description of processes where the…

The aim of this paper is to study supersoluble skew braces, a class of skew braces that encompasses all finite skew braces of square-free order. It turns out that finite supersoluble skew braces have Sylow towers, and that in an arbitrary…

The six-vertex F model on the square lattice constitutes the unique example of an exactly solved model exhibiting an infinite-order phase transition of the Kosterlitz-Thouless type. As one of the few non-trivial exactly solved models, it…

Higher-order pushdown systems (PDSs) generalise pushdown systems through the use of higher-order stacks, that is, a nested "stack of stacks" structure. These systems may be used to model higher-order programs and are closely related to the…