Date
1993
Description
La version de travail de cette communication attachée est intitulée "Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets".
Titre de la collection
Lecture Notes in Computer Science
n° dans la collection
674
Indexation documentaire
Informatique générale
Subject
Coloured nets; structural analysis; positive flows computation; Farkas' algorithm
Titre du colloque
12th International Conference on applications and theory of Petri nets (APN 1991)
Date du colloque
06-1991
Ville du colloque
Gjern
Pays du colloque
Danemark
Titre de l'ouvrage
Advances in Petri Nets 1993, Papers from the 12th International Conference on Applications and Theory of Petri Nets, Gjern, Denmark, June 1991
Auteur
Rozenberg, Grzegorz
Nom de l'éditeur
Springer
Ville de l'éditeur
Berlin
Année
1993
Nombre total de pages
457
ISBN
978-3-540-56689-2
Auteur
Peyre, Jean-François
Couvreur, Jean-Michel
Haddad, Serge
Type
Communication / Conférence
Nombre de pages du document
51-70
Résumé en anglais
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.
