Related papers: Structural Liveness of Conservative Petri Nets
Many categorical frameworks have been proposed to formalize the idea of gluing Petri nets with each other. Such frameworks model net gluings in terms of sharing of resources or synchronization of transitions. Interpretations given to these…
In many interesting situations the size of epsilon-nets depends only on $\epsilon$ together with different complexity measures. The aim of this paper is to give a systematic treatment of such complexity measures arising in Discrete and…
Self-organization of robust and efficient networks is important for a future design of communication or transportation systems, because both characteristics are not coexisting in many real networks. As one of the candidates for the…
Although sparse neural networks have been studied extensively, the focus has been primarily on accuracy. In this work, we focus instead on network structure, and analyze three popular algorithms. We first measure performance when structure…
Detectability of discrete event systems (DESs) is a property to determine a priori whether the current and subsequent states can be determined based on observations. In this paper, we investigate the verification of two detectability…
A self-organization of efficient and robust networks is important for a future design of communication or transportation systems, however both characteristics are incompatible in many real networks. Recently, it has been found that the…
In this note, we show that extremal Szemer\'{e}di-Trotter configurations are rigid in the following sense: If $P,L$ are sets of points and lines determining at least $C|P|^{2/3}|L|^{2/3}$ incidences, then there exists a collection $P'$ of…
A detailed analysis of three species-rich ecosystem food webs has shown that they display scale-free distributions of connections. Such graphs of interaction are in fact shared by a number of biological and technological networks, which…
Reversing Petri nets (RPNs) have recently been proposed as a net-basedapproach to model causal and out-of-causal order reversibility. They are based on the notion of individual tokens that can be connected together via bonds. In this paper…
We provide convex necessary and sufficient conditions for the robust stability of linear positively dominated systems. In particular we show that the structured singular value is always equal to its convex upper bound for nonnegative…
We consider nonlinear scalar conservation laws posed on a network. We establish $L^1$ stability, and thus uniqueness, for weak solutions satisfying the entropy condition. We apply standard finite volume methods and show stability and…
We consider a regular embedded network composed by two curves, one of them closed, in a convex domain $\Omega$. The two curves meet only in one point, forming angle of $120$ degrees. The non-closed curve has a fixed end point on…
A compositional Petri net-based semantics is given to a simple language allowing pointer manipulation and parallelism. The model is then applied to give a notion of validity to the judgements made by concurrent separation logic that…
We prove that under a small-gain condition, an interconnection of two globally incrementally exponentially stable systems inherits this property on any compact connected forward invariant set. It is also demonstrated that the…
Our objective is to design a controlled system with a simple method for discrete event systems based on Petri nets. It is possible to construct the Petri net model of a system and the specification separately. By synchronous composition of…
We present necessary conditions for monotonicity, in one form or another, of fixed point iterations of mappings that violate the usual nonexpansive property. We show that most reasonable notions of linear-type monotonicity of fixed point…
Investigating relation between various structural patterns found in real-world networks and stability of underlying systems is crucial to understand importance and evolutionary origin of such patterns. We evolve multiplex networks,…
We discuss structure-preserving numerical discretizations for repulsive and attractive Euler-Poisson equations that find applications in fluid-plasma and self-gravitation modeling. The scheme is fully discrete and structure preserving in…
We show that if a finite point set $P\subseteq \mathbb{R}^2$ has the fewest congruence classes of triangles possible, up to a constant $M$, then at least one of the following holds. (1) There is a $\sigma>0$ and a line $l$ which contains…
In 1998 Burago and Kleiner and (independently) McMullen gave examples of separated nets in Euclidean space which are non-bilipschitz equivalent to the integer lattice. We study weaker notions of equivalence of separated nets and demonstrate…