Related papers: Petri Nets and its Polynomials
We investigate Petri nets with data, an extension of plain Petri nets where tokens carry values from an infinite data domain, and executability of transitions is conditioned by equalities between data values. We provide a decision procedure…
We identify the Atkin polynomials in terms of associated Jacobi polynomials. Our identificationthen takes advantage of the theory of orthogonal polynomials and their asymptotics to establish many new properties of the Atkin polynomials.…
We prove that the inverse of the Hankel matrix of the reciprocals of the Catalan numbers has integer entries. We generalize the result to an infinite family of generalized Catalan numbers. The Hankel matrices that we consider are associated…
A couple of complex projective plane curves are said to make a Zariski pair if they have the same degree and the same type of singularities, but their embeddings in the projective plane are topologically different. In this paper, we present…
We develop a polynomial translation from finite control pi-calculus processes to safe low-level Petri nets. To our knowledge, this is the first such translation. It is natural in that there is a close correspondence between the control…
We construct the canonical structure of an irreducible projective variety on the set of connected curves of degree $d$ in $\Bbb P^n$ with rational components (some components can be multiple). The set of rational curves is open subset in…
Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…
A universal deterministic inhibitor Petri net with 14 places, 29 transitions and 138 arcs was constructed via simulation of Neary and Woods' weakly universal Turing machine with 2 states and 4 symbols; the total time complexity is…
A net in $\mathbb{P}^2$ is a configuration of lines $\mathcal A$ and points $X$ satisfying certain incidence properties. Nets appear in a variety of settings, ranging from quasigroups to combinatorial design to classification of Kac-Moody…
Persymmetric Jacobi matrices are invariant under reflection with respect to the anti-diagonal. The associated orthogonal polynomials have distinctive properties that are discussed. They are found in particular to be also orthogonal on the…
We investigate decompositions of Betti diagrams over a polynomial ring within the framework of Boij--Soederberg theory. That is, given a Betti diagram, we decompose it into pure diagrams. Relaxing the requirement that the degree sequences…
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 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…
We study Torelli-type theorems in the Zariski topology for varieties of dimension at least 2, over arbitrary fields. In place of the Hodge structure, we use the linear equivalence relation on Weil divisors. Using this setup, we prove a…
In this work we give a full characterization of sets of multiple polynomial recurrence in Weyl systems, which are ergodic unipotent affine transformations on products of tori and finite abelian groups. In particular, we show that measurable…
We study compositional inverses of permutation polynomials, complete mappings, mutually orthogonal Latin squares, and bent vectorial functions. Recently it was obtained in [33] the compositional inverses of linearized permutation binomials…
We classify all Polish semigroup topologies on the symmetric inverse monoid on the natural numbers. This result answers a question of Elliott et al. There are countably infinitely many such topologies. Under containment, these Polish…
In this talk we are concerned with the intrinsic similarities and differences between Petri nets on the one hand, and membrane systems and reaction systems on the other hand.
Reversible computations constitute an unconventional form of computing where any sequence of performed operations can be undone by executing in reverse order at any point during a computation. It has been attracting increasing attention as…
Computing steady-state distributions in infinite-state stochastic systems is in general a very dificult task. Product-form Petri nets are those Petri nets for which the steady-state distribution can be described as a natural product…