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

We propose a formal model of concurrent systems in which the history of a computation is explicitly represented as a collection of events that provide a view of a sequence of configurations. In our model events generated by transitions…

Asynchronously communicating pushdown systems (ACPS) that satisfy the empty-stack constraint (a pushdown process may receive only when its stack is empty) are a popular decidable model for recursive programs with asynchronous atomic…

We determine the complexity of second-order HyperLTL satisfiability, finite-state satisfiability, and model-checking: All three are equivalent to truth in third-order arithmetic. We also consider two fragments of second-order HyperLTL that…

Sufficiently accurate finite state models, also called symbolic models or discrete abstractions, allow one to apply fully automated methods, originally developed for purely discrete systems, to formally reason about continuous and hybrid…

We show that surgery on a connected clover (or clasper) with at least one loop preserves the concordance class of a knot. Surgery on a slightly more special class of clovers preserves invertible concordance. We also show that the converse…

The completion of tensors, or high-order arrays, attracts significant attention in recent research. Current literature on tensor completion primarily focuses on recovery from a set of uniformly randomly measured entries, and the required…

We consider the model of the focusing one-dimensional nonlinear Schr\"odinger equation (fNLSE) in the presence of an unstable constant background, which exhibits coherent solitary wave structures -- breathers. Within the inverse scattering…

We study the closure of the convex hull of a compact set in a complete CAT(0) space. First we give characterization results in terms of compact sets and the closure of their convex hulls for locally compact CAT(0) spaces that are either…

Vertex cover is one of the classical NP-complete problems in theoretical computer science. A vertex cover of a graph is a subset of vertices such that for each edge at least one of the two endpoints is contained in the subset. When studied…

In this paper, we propose reachability analysis using constrained polynomial logical zonotopes. We perform reachability analysis to compute the set of states that could be reached. To do this, we utilize a recently introduced set…

This thesis develops some general calculational techniques for finding the orders of knots in the topological concordance group C. The techniques currently available in the literature are either too theoretical, applying to only a small…

A twisted state is an important yet simple form of collective dynamics in an oscillatory medium. Here, we describe a nontrivial type of twisted state in a system of nonlocally coupled Stuart-Landau oscillators. The nontrivial twisted state…

Using detailed exact results on pair-correlation functions of Z-invariant Ising models, we can write and run algorithms of polynomial complexity to obtain wavevector-dependent susceptibilities for a variety of Ising systems. Reviewing…

Cousot and Cousot introduced and studied a general past/future-time specification language, called mu*-calculus, featuring a natural time-symmetric trace-based semantics. The standard state-based semantics of the mu*-calculus is an abstract…

Constraint satisfaction problems have been studied in numerous fields with practical and theoretical interests. In recent years, major breakthroughs have been made in a study of counting constraint satisfaction problems (or #CSPs). In…

Standpoint linear temporal logic SLTL is a recent formalism able to model possibly conflicting commitments made by distinct agents, taking into account aspects of temporal reasoning. In this paper, we analyse the computational properties of…

We discuss the exact quantization of general one-dimensional potentials in view of the exact-WKB formalism. Building on our previous work, we perform analytic continuations across different sectors via the complexification to the spectral…

A foundational assumption in complex-system collapse studies is that critical transitions are second-order, preceded by early-warning signals like rising autocorrelation, variance, and critical slowing down (Scheffer, 2009). We show this…

Let $f$ be a transcendental entire function and let $A(f)$ denote the set of points that escape to infinity `as fast as possible' under iteration. By writing $A(f)$ as a countable union of closed sets, called `levels' of $A(f)$, we obtain a…

For scattering systems consisting of a (family of) maximal dissipative extension(s) and a selfadjoint extension of a symmetric operator with finite deficiency indices, the spectral shift function is expressed in terms of an abstract…