Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2403.11779

Home Spaces and Invariants to Analyze Parameterized Petri Nets

Gerard Memmi
View original source ↗Read source document ↗Export metadata ↓

Abstract

This article focuses on comparing the notions of home spaces and invariants, in Transition Systems and more particularly, in Petri Nets as well as a variety of derived Petri Nets. After recalling basic notions of Petri Nets and semiflows, we then discuss important characteristics of finite generating sets for F, the set of all semiflows with integer coordinates of a given Petri Net. Then, we particularly focus on F+ the set of semiflows with non-negative coordinates. Minimality of semiflows and minimality of supports are critical to develop effective analysis of invariants and behavioral properties of Petri Nets such as boundedness or even liveness. We recall known decomposition theorems considering N, Q+, or Q. The result over N is being improved into a necessary and sufficient condition. In addition, we present general new results about the topology and the behavioral properties of a Petri Net, illustrating the importance of considering semiflows with non-negative coordinates. Then, we regroup a number of results around the notion of home space and home state applied to transition systems. Home spaces and semiflows are used to efficiently support the analysis of behavioral properties. In this regard, we present a methodology to analyze a Petri Nets by successive refinement of home spaces directly deduced from semiflows and apply it to analyze a parameterized example drawn from the telecommunication industry underlining the efficiency brought by using minimal semiflows of minimal supports as well as the new results on the topology of the model. This methodology is better articulated than in previous papers, and brings us closer to an automated analysis.

Explore related subjects

cs.DMcs.LO

Keep this discovery

BibTeXRIS

Gerard Memmi. 2024-03-18. Home Spaces and Invariants to Analyze Parameterized Petri Nets. https://arxiv.org/abs/2403.11779

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

An FPTAS for Two-Machine Open-Shop Scheduling with a Single Unavailability Interval

We consider the two-machine open-shop scheduling problem in which one machine is unavailable during a fixed interval. We study the resumable setting: an operation interrupted by the unavailability interval may resume, without penalty, when the machine becomes available. The objective is to minimize the makespan. Although the problem is NP-hard and several approximation algorithms are known, whether it admits a fully polynomial-time approximation scheme (FPTAS) has remained open for two decades. We resolve this question affirmatively by giving the first FPTAS, thereby strengthening the previously known polynomial-time approximation scheme (PTAS). As an intermediate result, we develop a new pseudo-polynomial dynamic program with seven state dimensions, improving on the ten-dimensional formulation in the literature.

cs.DM↗
arXiv2026

Generalized Graph Search Trees

Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-trees and last-in trees that behave like DFS-trees. The search tree paradigms differ from each other by the parent a vertex is connected to. In first-in trees, it is the first visited neighbor, while in last-in trees it is the last neighbor visited before that vertex. Here, we will generalize these concepts of graph search trees by allowing every preceding neighbor of a vertex to be the parent. We study the complexity of the recognition problem of these generalized graph search trees. We present NP-completeness proofs for most searches. We also show that the problem is trivial for Generic Search and polynomial-time solvable for several searches on bipartite graphs and chordal graphs. We also study the question how fixing the start vertex influences the complexity of the problem.

cs.DM↗
arXiv2026

The exact asymptotic constant in the metric dimension of Jaccard space

Let $X$ be a finite set with $|X|=n$ and let $\mathrm{Jac}(a,b)=|a\,\triangle\, b|/|a\cup b|$ be the Jaccard distance on the power set $2^X$. Lladser and Paradise recently proved that the metric dimension of $(2^X,\mathrm{Jac})$ is $\Theta(n/\ln n)$, with the constant left open; their bounds are $(\ln 2)\,n/\ln n\lesssim \beta(2^X,\mathrm{Jac})\lesssim 2\ln(2e)\,n/\ln n$. We determine the constant: \[ \beta(2^X,\mathrm{Jac})=\frac{2n}{\log_2 n}\,(1+o(1))=(2\ln 2)\,\frac{n}{\ln n}\,(1+o(1)). \] The proof identifies the problem, on each ``slice'' of subsets of fixed cardinality, with the Erd\H{o}s--R\'enyi coin-weighing problem for a spring scale (the problem of \emph{detecting matrices}). The lower bound is the Erd\H{o}s--R\'enyi entropy argument applied to the middle slice; the upper bound follows from the explicit detecting families of Lindstr\"om and of Cantor and Mills, augmented by a single extra landmark that reveals cardinality.

cs.DM↗