|
 
|
[CHP91] Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets
Conférence Internationale avec comité de lecture : 12th Int. Conf. on Application and Theory of Petri Nets, January 1991,
motcle:
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.
Commentaires:
note
BibTeX
| @inproceedings { | |||
| CHP91, | |||
| title | = | "{Computation of Generative Families of Positive Semi-Flows in Two Types of Coloured Nets}", | |
| author | = | " J. Couvreur and S. Haddad and J. Peyre ", | |
| booktitle | = | "{12th Int. Conf. on Application and Theory of Petri Nets}", | |
| year | = | 1991, | |
| month | = | "January", | |
| note | = | "{note}", | |
| } | |||
