Related papers: Petri Net Invariant Synthesis
Detectability describes the property of a system whose current and the subsequent states can be uniquely determined after a finite number of observations. In this paper, we developed a novel approach to verifying strong detectability and…
We propose an improved approach to carry out the imaginary time evolution of infinite projected entangled-pair states (iPEPS), especially for systems with criticality. A cyclic optimal truncation is introduced to update the tensors along a…
We describe a collection of computer scripts written in PARI/GP to compute, for reflection groups determined by finite-volume polyhedra in $\mathbb{H}^3$, the commensurability invariants known as the invariant trace field and invariant…
Supersymmetric models with an inverted mass hierarchy (IMH: multi-TeV first and second generation matter scalars, and sub-TeV third generation scalars) can ameliorate problems arising from flavor changing neutral currents, $CP$ violating…
For every finite Petri net, we construct a commutative polynomial in two variables and with coefficients from the semiring of natural numbers. We also present an inverse construction and show that multiplication of polynomials…
We introduce a new system of split variational inequality problems which is a natural extension of split variational inequality problem in semi-inner product spaces. We use the retraction technique to propose an iterative algorithm for…
A Petri net is choice-free if any place has at most one transition in its postset (consuming its tokens) and it is (extended) free-choice (EFC) if the postsets of any two places are either equal or disjoint. Asymmetric choice (AC) extends…
Invariant random subgroups (IRS) are conjugacy invariant probability measures on the space of subgroups in a given group G. They can be regarded both as a generalization of normal subgroups as well as a generalization of lattices. As such,…
We construct integrable models on flag manifold by using the symplectic structure explicitly given in the Bruhat coordinatization of flag manifold. They are non-commutative integrable and some of the conserved quantities are given by the…
A fundamental computational task in probabilistic programming is to infer a program's output (posterior) distribution from a given initial (prior) distribution. This problem is challenging, especially for expressive languages that feature…
The exact contraction of a generic two-dimensional (2D) tensor network state (TNS) is known to be exponentially hard, making simulation of 2D systems difficult. The recently introduced class of isometric TNS (isoTNS) represents a subset of…
Quantum annealing is an emerging new platform for combinatorial optimization, requiring an Ising model formulation for optimization problems. The formulation can be an essential obstacle to the permeation of this innovation into broad areas…
We describe a general method for verifying inequalities between real-valued expressions, especially the kinds of straightforward inferences that arise in interactive theorem proving. In contrast to approaches that aim to be complete with…
This paper presents a set of algorithms for computing the reachability graph of Petri Net Product Lines (PNPLs). These algorithms address the combined challenges of concurrency and variability that arise from product-line configurations.…
Under-approximations of reachable sets and tubes have been receiving growing research attention due to their important roles in control synthesis and verification. Available under-approximation methods applicable to continuous-time linear…
In this paper we try to find examples of integrable natural Hamiltonian systems on the sphere $S^2$ with the symmetries of each Platonic polyhedra. Although some of these systems are known, their expression is extremely complicated; we try…
Motivated by multi-user optimization problems and non-cooperative Nash games in stochastic regimes, we consider stochastic variational inequality (SVI) problems on matrix spaces where the variables are positive semidefinite matrices and the…
Iterative hard thresholding (IHT) is a projected gradient descent algorithm, known to achieve state of the art performance for a wide range of structured estimation problems, such as sparse inference. In this work, we consider IHT as a…
A new systematic method for the explicit construction of (basis-)invariants is introduced and employed to construct the full ring of basis invariants of the Two-Higgs-Doublet-Model (2HDM) scalar sector. Co- and invariant quantities are…
The Hybrid Integral Gain Systems (HIGS) has recently gained a lot of attention in the control of precision motion systems. HIGS is a nonlinear low pass filter with a 52 degree phase advantage over its linear counterpart. This property…