Search arXivSearch

arXiv · 2403.11779

Home Spaces and Invariants to Analyze Parameterized Petri Nets

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

Keep this discovery

Explore connections, maps & timelines

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

Factorisability of Low Dimensional Non-Negative Integer Matrices

We consider the problem of determining if a given two-dimensional nonnegative integer matrix $M$ is the product of two such matrices, excluding trivial units. A matrix $M$ with no such factorisation is called prime and therefore belongs to the minimal (infinite rank) generator of $2 \times 2$ matrices over the natural numbers, otherwise it is called composite. We also consider the problem of finding a (non-unique) factorisation of a composite matrix. Our results have applications in computational group theory and the theory of codes, where such matrices are called incidence matrices. We analyse the complexity of primality and finding a factorisation for a composite matrix, providing a first efficient algorithm.

cs.DM

The parameterised complexity of generalised temporal domination on temporal graphs with modular structure

Inspired by the static problem $(α,β)$-Dominating Set, we propose a general temporal domination problem, called $(α,β)$-Temporal Dominating Set ($(α,β)$-TDS). We show that this problem encompasses Temporal Dominating Set, and additionally provides first temporal extensions of problems such as $k$-Dominating Set and $α$-Dominating Set. In this paper, we study the parameterised complexity of $(α,β)$-TDS with respect to temporal neighbourhood diversity (TND), temporal modular-width (TMW), and temporal cliquewidth (TCW). We obtain fixed parameter tractability results for all values of $α$ and $β$ with respect to TND; W[1]-hardness with respect to TMW and TCW whenever $β$ is in the problem input, or whenever $α\in (0,1)$ and $β$ is a fixed constant; and para-NP-hardness with respect to TCW when $α= 0$ and $β= 1$, or $α= 1$ and $β= 0$.

cs.DM