相关论文: Two polygraphic presentations of Petri nets
The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…
In this paper we indicate one method of construction of linear representations of groups and algebras with translation invariant (except, maybe , finite number) defining relationships. As an illustration of this method, we give one approach…
This paper initiates the dialectical approach to net theory. This approach views nets as special, but very important and natural, dialectical systems. By following this approach, a suitably generalized version of nets, called dialectical…
Multinets are certain configurations of lines and points with multiplicities in the complex projective plane P2. They are used in the studies of resonance and characteristic varieties of complex hyperplane arrangement complements and…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
We consider timed Petri nets, i.e., unbounded Petri nets where each token carries a real-valued clock. Transition arcs are labeled with time intervals, which specify constraints on the ages of tokens. Our cost model assigns token storage…
Linear constraint transformation is an essential step to solve the forbidden state problem in Petri nets that contain uncontrollable transitions. This work studies the equivalent transformation from a legal-marking set to its…
Links in $S^3$ as well as Legendrian links in the standard tight contact structure on $S^3$ can be encoded by grid diagrams. These consist of a collection of points on a toroidal grid, connected by vertical and horizontal edges. Blackwell,…
Graph is a universe data structure that is widely used to organize data in real-world. Various real-word networks like the transportation network, social and academic network can be represented by graphs. Recent years have witnessed the…
Graphs, and graph transformation systems, are used in many areas within Computer Science: to represent data structures and algorithms, to define computation models, as a general modelling tool to study complex systems, etc. Research in term…
This paper describes a case study for the sixth Transformation Tool Contest. The case is based on a mapping from Petri-Nets to statecharts (i.e., from flat process models to hierarchical ones). The case description separates a simple…
The organization of interactions in complex systems can be described by networks connecting different units. These graphs are useful representations of the local and global complexity of the underlying systems. The origin of their…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…
We study the Betti tables of reducible algebraic curves with a focus on connected line arrangements and provide a general formula for computing the quadratic strand of the Betti table for line arrangements that satisfy certain hypotheses.…
Let G be a simple algebraic group. Labelled trivalent graphs called webs can be used to product invariants in tensor products of minuscule representations. For each web, we construct a configuration space of points in the affine…
We define a moduli space of translation structures on the open topological disk with a basepoint and endow it with a locally-compact metrizable topology. We call this the immersive topology, because it is defined using the concept of…
We present theoretical rudiments of Petri nets over ontological graphs as well as the designed and implemented Python toolkit for dealing with such nets. In Petri nets over ontological graphs, the domain knowledge is enclosed in a form of…
In many domains (e.g. Internet of Things, neuroimaging) signals are naturally supported on graphs. These graphs usually convey information on similarity between the values taken by the signal at the corresponding vertices. An interest of…
We discuss elliptic Pl\"ucker transformations of three-dimensional elliptic spaces. These are permutations on the set of lines such that any two related (orthogonally intersecting or identical) lines go over to related lines in both…
In the present work we focus on the case of (few-site) configurations respecting the PT-symmetry. We examine the case of such "oligomers" with not only 2-sites, as in earlier works, but also the cases of 3- and 4-sites. While in the former…