|
 
|
[EPP07] A simple positive flows computation algorithm for a large subclass of colored nets
Conférence Internationale avec comité de lecture : IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems, January 2007, pp.177-195, Series LNCS,
motcle:
Résumé:
Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of ) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem.
We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large sub class of colored nets: the simple well-formed nets.
BibTeX
| @inproceedings { | |||
| EPP07, | |||
| title | = | "{A simple positive flows computation algorithm for a large subclass of colored nets}", | |
| author | = | " S. Evangelista and C. Pajault and J. Pradat-Peyre ", | |
| booktitle | = | "{IFIP WG 6.1 Int. Conf. on Formal Techniques for Networked and Distributed Systems}", | |
| year | = | 2007, | |
| month | = | "January", | |
| series | = | "LNCS", | |
| issue | = | 27, | |
| pages | = | "177-195", | |
| } | |||
