Related papers: Petri Nets and its Polynomials
Computing the real solutions to a system of polynomial equations is a challenging problem, particularly verifying that all solutions have been computed. We describe an approach that combines numerical algebraic geometry and sums of squares…
We use functoriality of tropicalization and the geometry of projections of subvarieties of tori to show that the fibers of the tropicalization map are dense in the Zariski topology. For subvarieties of tori over fields of generalized power…
In this paper, we develop some foundations for a theory of algebraic varieties of congruences on commutative semirings. By studying the structure of congruences, firstly, we show that the spectrum $ \text{Spec}^{c}(A) $ consisting of prime…
This paper develops the algebraic foundation required to build a Zariski-type geometry for \emph{commutative ternary $\Gamma$-semirings}, where multiplication is an inherently triadic, multi-parametric interaction…
We characterize the Zariski topologies over an algebraically closed field in terms of general dimension-theoretic properties. Some applications are given to complex manifold and to strongly minimal sets.
We study simplicial complexes with a given number of vertices whose Stanley-Reisner ring has the minimal possible Betti numbers. We find that these simplicial complexes have very special combinatorial and topological structures. For…
In the setting of Petri nets, we prove that {\em causal-net bisimilarity} \cite{G15,Gor22,Gor25a}, which is a refinement of history-preserving bisimilarity \cite{RT88,vGG89,DDM89}, and the novel {\em hereditary} causal-net bisimilarity,…
Recently, Gross, Mansour, and Tucker introduced the partial Petrial polynomial, which enumerates all partial Petrials of a ribbon graph by Euler genus. They provided formulas or recursions for various families of ribbon graphs, including…
Using the notion of multivariate lower set interpolation, we construct nodal basis functions for the serendipity family of finite elements, of any order and any dimension. For the purpose of computation, we also show how to express these…
We give an explicit Pieri formula for Macdonald polynomials attached to the root system C_n (with equal multiplicities). By inversion we obtain an explicit expansion for two-row Macdonald polynomials of type C.
Let ${\mathcal {B}}$ be a reducible reduced plane curve. We introduce a new point of view to study the topology of $(\PP^2, {\mathcal {B}})$ via Galois covers and Alexander polynomials. We show its effectiveness through examples of Zariski…
We introduce {\omega}-Petri nets ({\omega}PN), an extension of plain Petri nets with {\omega}-labeled input and output arcs, that is well-suited to analyse parametric concurrent systems with dynamic thread creation. Most techniques (such as…
Context: Petri net slicing is a technique to reduce the size of a Petri net to ease the analysis or understanding of the original Petri net. Objective: Presenting two new Petri net slicing algorithms to isolate those places and transitions…
We compute the Betti numbers of the geometric spaces associated to nonrational simple convex polytopes and find that they depend on the combinatorial type of the polytope exactly as in the rational case. This shows that the combinatorial…
We survey 25 years of research on decidability issues for Petri nets. We collect results on the decidability of important properties, equivalence notions, and temporal logics.
In this paper we introduce the notion of spread net. Spread nets are (safe) Petri nets equipped with vector clocks on places and with ticking functions on transitions, and are such that vector clocks are consistent with the ticking of…
A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
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…
We construct two complete invariants of oriented classical knots in space. The value of each invariant on any knot is a set, infinite for the first invariant and finite for the second. The finite set is computed algorithmically from any…