Generative Families of Positive Invariants in Coloured Nets Sub-Classes
Couvreur, Jean-Michel; Haddad, Serge; Pradat-Peyre, Jean-François (1993), Generative Families of Positive Invariants in Coloured Nets Sub-Classes, in Rozenberg, Grzegorz, Advances in Petri Nets 1993, Springer : Berlin, p. 51-70. http://dx.doi.org/10.1007/3-540-56689-9_39
TypeCommunication / Conférence
Conference title12th International Conference on Applications and Theory of Petri Nets
Book titleAdvances in Petri Nets 1993
Book authorRozenberg, Grzegorz
Series titleLecture Notes in Computer Science
Number of pages457
MetadataShow full item record
Abstract (EN)In Petri nets and high-level nets, positive flows provide additional informations to the ones given by the flows. For instance with the help of positive flows one decides the structural boundeness of the nets and one detects the structural implicit places. Up to now, no computation of positive flows has been developed for coloured nets. In this paper, we present a computation of positive flows for two basic families of coloured nets: unary regular nets and unary predicate/transition nets. At first we show that these two computations are reducible to the resolution of the parametrized equation A.X 1 = ... = A.X n where A is a matrix, Xi, the unknowns are vectors and n is the parameter. Then we present an algorithm to solve this equation. At last we show how the solutions of the parametrized equation can be used to solve the complete equations system for unary regular nets and unary predicate/transition nets.
Subjects / KeywordsColoured nets; structural analysis; positive flows computation; Farkas' algorithm
Showing items related by title and author.