Related papers: Event Structures for Petri nets with Persistence
We model the robustness against random failure or intentional attack of networks with arbitrary large-scale structure. We construct a block-based model which incorporates --- in a general fashion --- both connectivity and interdependence…
Petri-nets are a simple formalism for modeling concurrent computation. Recently, they have emerged as a powerful tool for the modeling and analysis of biochemical reaction networks, bridging the gap between purely qualitative and…
The execution of different cases of a process is often restricted by inter-case dependencies through e.g., queueing or shared resources. Various high-level Petri net formalisms have been proposed that are able to model and analyze…
Reversible computing is a new paradigm that has emerged recently and extends the traditional forwards-only computing mode with the ability to execute in backwards, so that computation can run in reverse as easily as in forward. Two…
Citation networks can reveal many important information regarding the development of science and the relationship between different areas of knowledge. Thus, many studies have analyzed the topological properties of such networks.…
We present an event structure classification empirically derived from inferential properties annotated on sentence- and document-level Universal Decompositional Semantics (UDS) graphs. We induce this classification jointly with semantic…
"Emergence", the phenomenon where a complex system displays properties, behaviours, or dynamics not trivially reducible to its constituent elements, is one of the defining properties of complex systems. Recently, there has been a concerted…
Mechanisms of pattern formation---of which the Turing instability is an archetype---constitute an important class of dynamical processes occurring in biological, ecological and chemical systems. Recently, it has been shown that the Turing…
Percolation theory is an approach to study vulnerability of a system. We develop analytical framework and analyze percolation properties of a network composed of interdependent networks (NetONet). Typically, percolation of a single network…
A common goal in network modeling is to uncover the latent community structure present among nodes. For many real-world networks, the true connections consist of events arriving as streams, which are then aggregated to form edges, ignoring…
The reachability semantics for Petri nets can be studied using open Petri nets. For us an "open" Petri net is one with certain places designated as inputs and outputs via a cospan of sets. We can compose open Petri nets by gluing the…
This paper deals with the reachability analysis of {P,A}-Time Petri nets ({P,A}-TPN in short) in the context of strong semantics. It investigates the convexity of the union of state classes reached by different interleavings of the same set…
Traditional works on community detection from observations of information cascade assume that a single adjacency matrix parametrizes all the observed cascades. However, in reality the connection structure usually does not stay the same…
Complex systems display emergent phenomena that vary significantly across spatial and temporal scales. These variations originate from fine-grained system processes, yet arriving at macroscopic dynamics from micro-level data -- particularly…
Most existing time-to-event methods focus on either single-event or competing-risks settings, leaving multi-event scenarios relatively underexplored. In many healthcare applications, for example, a patient may experience multiple clinical…
Three events in a probability space form a conjunctive fork if they satisfy specific constraints on conditional independence and covariances. Patterns of conjunctive forks within collections of events are characterized by means of systems…
A marked Petri net is lucent if there are no two different reachable markings enabling the same set of transitions, i.e., states are fully characterized by the transitions they enable. This paper explores the class of marked Petri nets that…
Many social, biological, and technological systems are recorded as sequences of time-stamped interactions. In such systems, concurrency, i.e., the tendency for an individual to participate in multiple interactions approximately at the same…
This paper describes a stand-alone, no-frills tool supporting the analysis of (labelled) place/transition Petri nets and the synthesis of labelled transition systems into Petri nets. It is implemented as a collection of independent,…
Finite 1-safe Petri nets, also called \emph{net systems}, are natural models of asynchronous concurrency. The event structure of a net system describes all its possible executions and their concurrent nature: two events may be causally…