Related papers: Morphisms of Coloured Petri Nets
The disjoint union of mapping class groups of surfaces forms a braided monoidal category $\mathcal M$, as the disjoint union of the braid groups $\mathcal B$ does. We give a concrete, and geometric meaning of the braiding $\beta_{r,s}$ in…
In this paper, we consider categories with colored morphisms and functors such that morphisms assigned to morphisms with a common color have a common color. In this paper, we construct a morphism-colored functor such that any…
We continue our study of the categories of quantum liquids started in a previous work. We combine local quantum symmetries with topological skeletons into a single mathematical theory of topological nets and defect nets. In particular, we…
One of the most important concepts in biological network analysis is that of network motifs, which are patterns of interconnections that occur in a given network at a frequency higher than expected in a random network. In this work we are…
Causal nets (CNs) are Petri nets where causal dependencies are modelled via inhibitor arcs. They play the role of occurrence nets when representing the behaviour of a concurrent and distributed system, even when reversibility is considered.…
We present a unified framework for Petri nets and various variants, such as pre-nets and Kock's whole-grain Petri nets. Our framework is based on a less well-studied notion that we call $\Sigma$-nets, which allow finer control over whether…
Percolation in complex networks is viewed as both: a process that mimics network degradation and a tool that reveals peculiarities of the underlying network structure. During the course of percolation, networks undergo non-trivial…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
Classical Petri nets provide a canonical model of concurrency, with unfolding semantics linking nets, occurrence nets, and event structures. No comparable framework exists for quantum concurrency: existing ''quantum Petri nets'' lack…
We introduce the first graph kernels for metric graphs via tropical algebraic geometry. In contrast to conventional graph kernels based on graph combinatorics such as nodes, edges, and subgraphs, our metric graph kernels are purely based on…
The mathematical formalisms used to model biological systems induce both latent and ambiguous assumptions that can limit or distort their representational capabilities. Developing formalisms that can represent systems more precisely is…
In this paper, domination in Signed Petri net(SPN) has been introduced.We identify some of the Petri net structures where a dominating set can exist.Applications of producer consumer problem, searching of food by bees and finding similarity…
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,…
We define a sutured cobordism category of surfaces with boundary and 3-manifolds with corners. In this category a sutured 3-manifold is regarded as a morphism from the empty surface to itself. In the process we define a new class of…
A {\em kernel by properly colored paths} of an arc-colored digraph $D$ is a set $S$ of vertices of $D$ such that (i) no two vertices of $S$ are connected by a properly colored directed path in $D$, and (ii) every vertex outside $S$ can…
Recent work by the authors equips Petri occurrence nets (PN) with probability distributions which fully replace nondeterminism. To avoid the so-called confusion problem, the construction imposes additional causal dependencies which restrict…
Classical Petri nets provide a canonical model of concurrency, with unfolding semantics linking nets, occurrence nets, and event structures. No comparable framework exists for quantum concurrency: existing ''quantum Petri nets'' lack…
Petri nets are a mathematical language for modeling and reasoning about distributed systems. In this paper we propose an approach to Petri nets for embedding reversibility, i.e., the ability of reversing an executed sequence of operations…
Many real complex systems cannot be represented by a single network, but due to multiple sub-systems and types of interactions, must be represented as a multiplex network. This is a set of nodes which exist in several layers, with each…
We describe a coordinate-free notion of conformal nets as a mathematical model of conformal field theory. We define defects between conformal nets and introduce composition of defects, thereby providing a notion of morphism between…