相关论文: 1-Safe Petri nets and special cube complexes: equi…

Trace properties, which are sets of execution traces, are often used to analyze systems, but their expressiveness is limited. Clarkson and Schneider defined hyperproperties as a generalization of trace properties to sets of sets of traces.…

A T-net of order $m$ is a graph with $m$ nodes and $2m$ directed edges, where every node has indegree and outdegree equal to $2$. (A well known example of T-nets are de Bruijn graphs.) Given a T-net $N$ of order $m$, there is the so called…

In reality, many real-world networks interact with and depend on other networks. We develop an analytical framework for studying interacting networks and present an exact percolation law for a network of $n$ interdependent networks (NON).…

Ensuring physical-layer security in non-terrestrial networks (NTNs) is challenging due to their global coverage and multi-hop relaying across heterogeneous network layers, where the locations and channels of potential eavesdroppers are…

In process mining, alignments quantify the degree of deviation between an observed event trace and a business process model and constitute the most important conformance checking technique. We study the algorithmic complexity of computing…

A non-uniform hypergraph $H=(V,E)$ consists of a vertex set $V$ and an edge set $E\subseteq 2^V$; the edges in $E$ are not required to all have the same cardinality. The set of all cardinalities of edges in $H$ is denoted by $R(H)$, the set…

This paper considers the cohomology and bounded interpolation of nonstandard finite element complexes, e.g. Stokes, Hessian, Elasticity, divdiv. Compared to the standard finite element exterior calculus, the main challenge is the existence…

This paper proposes a semi-structural approach to verify the nonblockingness of a Petri net. We construct a structure, called minimax basis reachability graph (minimax-BRG): it provides an abstract description of the reachability set of a…

Recently L. Nicolaescu and the author formulated a conjecture which relates the geometric genus of a complex analytic normal surface singularity (whose link $M$ is a rational homology sphere) with the Seiberg-Witten invariant of $M$…

Let $S,T$ be two distinct finite Abelian groups with $|S|=|T|$. A fundamental theorem of Tutte shows that a graph admits a nowhere-zero $S$-flow if and only if it admits a nowhere-zero $T$-flow. Jaeger, Linial, Payan and Tarsi in 1992…

We propose a definition of {\it security} and a definition of {\it robustness} of networks against the cascading failure models of deliberate attacks and random errors respectively, and investigate the principles of the security and…

In 2007, Bogomolov and Tschinkel proved that given two complex elliptic curves $E_1$ and $E_2$ along with even degree-$2$ maps $\pi_j\colon E_j\to \mathbb{P}^1$ having different branch loci, the intersection of the image of the torsion…

In this paper, we study the problem of non-blockingness verification by tapping into the basis reachability graph (BRG). Non-blockingness is a property that ensures that all pre-specified tasks can be completed, which is a mandatory…

We prove that the multiplication of sections of globally generated line bundles on a model wonderful variety M of simply connected type is always surjective. This follows by a general argument which works for every wonderful variety and…

The space of chains on a compact connected space encodes all the different ways of continuously growing out of a point until exhausting the space. A chain is \emph{generic} if its orbit under the action of the underlying homeomorphism group…

The Newlander-Nirenberg theorem says that a formally integrable complex structure is locally equivalent to the standard complex structure in the complex Euclidean space. In this paper, we consider two natural generalizations of the…

Unordered data Petri nets (UDPN) are an extension of classical Petri nets with tokens that carry data from an infinite domain and where transitions may check equality and disequality of tokens. UDPN are well-structured, so the coverability…

Let G be an n-dimensional crystallographic group (n-space group). If G is a Z-reducible, then the flat n-orbifold E^n/G has a nontrivial fibered orbifold structure. We prove that this structure can be described by a generalized Calabi…

A circular-arc hypergraph $H$ is a hypergraph admitting an arc ordering, that is, a circular ordering of the vertex set $V(H)$ such that every hyperedge is an arc of consecutive vertices. An arc ordering is tight if, for any two hyperedges…

Quantum computational pseudorandomness has emerged as a fundamental notion that spans connections to complexity theory, cryptography and fundamental physics. However, all known constructions of efficient quantum-secure pseudorandom objects…