Related papers: Persistent Permutability in Choice Petri Nets
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.…
Our current world is linked by a complex mesh of networks where information, people and goods flow. These networks are interdependent each other, and present structural and dynamical features different from those observed in isolated…
In this paper, we conjecture that if the permutation invariance of neural networks is taken into account, SGD solutions will likely have no barrier in the linear interpolation between them. Although it is a bold conjecture, we show how…
Leroux has proved that unreachability in Petri nets can be witnessed by a Presburger separator, i.e. if a marking $\vec{m}_\text{src}$ cannot reach a marking $\vec{m}_\text{tgt}$, then there is a formula $\varphi$ of Presburger arithmetic…
Metacommunity theory is considered a promising approach for explaining species diversity and food web complexity. Recently Pillai et al. proposed a simple modeling framework for the dynamics of food webs at the metacommunity level. Here, we…
In this study, we explore the inherent trade-off between accuracy and robustness in neural networks, drawing an analogy to the uncertainty principle in quantum mechanics. We propose that neural networks are subject to an uncertainty…
Recent studies on the evolutionary dynamics of the Prisoner's Dilemma game in scale-free networks have demonstrated that the heterogeneity of the network interconnections enhances the evolutionary success of cooperation. In this paper we…
We consider a hypergraph (I,C), with possible multiple (hyper)edges and loops, in which the vertices $i\in I$ are interpreted as agents, and the edges $c\in C$ as contracts that can be concluded between agents. The preferences of each agent…
We solve a conjecture on multiple nondegenerate steady states, and prove bistability for sequestration networks. More specifically, we prove that for any odd number of species, and for any production factor, the fully open extension of a…
It is known that a Sleptsov net, with multiple firing a transition at a step, runs exponentially faster than a Petri net opening prospects for its application as a graphical language of concurrent programming. We provide classification of…
Model checking is an important aim of the theoretical computer science. It enables the verification of a model with a set of properties such as liveness, deadlock or safety. One of the typical modelling techniques are Petri nets they are…
The increasing volume of ecologically and biologically relevant data has revealed a wide collection of emergent patterns in living systems. Analyzing different datasets, ranging from metabolic gene-regulatory to species interaction…
Recently for a class of critically intermittent random systems a phase transition was found for the finiteness of the absolutely continuous invariant measure. The systems for which this result holds are characterized by the interplay…
Shift invariance is a critical property of CNNs that improves performance on classification. However, we show that invariance to circular shifts can also lead to greater sensitivity to adversarial attacks. We first characterize the margin…
Synthesis for a type $\tau$ of Petri nets is the following search problem: For a transition system $A$, find a Petri net $N$ of type $\tau$ whose state graph is isomorphic to $A$, if there is one. To determine the computational complexity…
We consider approaches for causal semantics of Petri nets, explicitly representing dependencies between transition occurrences. For one-safe nets or condition/event-systems, the notion of process as defined by Carl Adam Petri provides a…
In this paper, we are concerned with the permanence of a Lotka-Volterra model of three competing species with seasonal succession. Based on the existence of a carrying simplex, that is a globally attracting hypersurface of codimension one,…
One aim shared by multiple settings, such as continual learning or transfer learning, is to leverage previously acquired knowledge to converge faster on the current task. Usually this is done through fine-tuning, where an implicit…
The relationship between network topology and system dynamics has significant implications for unifying our understanding of the interplay among metabolic, gene-regulatory, and ecosystem network architecures. Here we analyze the stability…
The robustness property of exponential dichotomies refers to the stability of this notion under small linear perturbations. In recent work~\cite{PPX}, the authors have identified a new class of perturbations under which the notion of a…