Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 1991

Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets

Résumé

It is well known that a generative family of positive semi-flows provides a more accurate information than a generative family of ordinary ones. In this paper, the authors present a computation of positive flows for two families of coloured nets: unary regular nets and unary predicat/transition nets. The authors show that these two computations are based on the resolution of a parametrized equation. An algorithm is presented to solve this equation and the authors show how this algorithm can be used to compute the generative family of semi-flows in the unary regular nets and unary predicate/transition nets.
Fichier non déposé

Dates et versions

hal-01124761 , version 1 (06-03-2015)

Identifiants

  • HAL Id : hal-01124761 , version 1

Citer

Jean-Michel M Couvreur, Serge Haddad, Jean-François F Peyre. Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets. 12th Int. Conf. on Application and Theory of Petri Nets, Jan 1991, X, France. ⟨hal-01124761⟩
28 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More