Author:
Evangelista S.,Pajault C.,Pradat-Peyre J. F.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Lecture Notes in Computer Science;G. Berthelot,1985
2. Lecture Notes in Computer Science;E. Bruneton,1999
3. Chiola, C., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed colored nets and their symbolic reachability graph. In: ICATPN, Paris-France (June 1990)
4. Colom, J.M., Silva, M.: Convex geometry and semiflows in P/T nets. A comparative study of algorithms for computation of minimal P-semiflows. Lecture Notes in Computer Science. Advances in Petri Nets 1990, (NewsletterInfo: 33,390) vol. 483, pp. 79–112 (1991)
5. Couvreur, J.M., Haddad, S., Peyre, J.F.: Computation of generative families of positive semi-flows in two types of coloured nets. In: Proceedings of the 12th International Conference on Application and Theory of Petri Nets, Gjern, Denmark, pp. 122–144, NewsletterInfo: 39 (June 1991)