Agerwala and Y. Choed-AmphaiA Synthesis Rule for Concurrent-Systems, Proc. l5th Design Automation Conference, pp.305-311, 1978. ,
Recherche des Semi-Flots, des Verrous et des Trappes dans les Réseaux de Petri, Technique et Sciences Informatiques, 1985. ,
FIow Analysis of Stochasric Marked Graphs, Proceedings CDC, vol.891, 1989. ,
Transformation et Analyse de Réseaux de Petri, Thèse d'Erar, 1983. ,
Réseaux, de Petri :Théorie et Pratique, Masson, vol.83, 1983. ,
A Survey of Behavior and Equivalence Preserving Refinements of Petri Nets Advances in Petri Nets, Lecture Notes in Computer Science, vol.483, p.46, 1990. ,
On Quauing Nework Models of Flexible Manufacturing Systems, Queuing System Theory and Applicarion, 1986. ,
A Stepwise Specification of a Manufacturing System Using Petri Nets, IEEE conference on Systems, Man and Cybemetics, 1991. ,
Convex Geometry and Semiflows in PIT Nets Advances in Petri Nets 90, Lecture Notes in Computer Science, vol.483, 1991. ,
Practise of Petri Nets in Manufacturing, 1993. ,
Sequencing and scheduling: an introduction to the mathemailcs oJ'the job-shop, Brench, vol.821, 1982. ,
Fundamewals of Queing Theory, 1974. ,
A Botton-IJp Approach for the Desîgn of Discrete Manufacturing System, Rensselaer's Third International Conference on Computer Integrated Manufacturing, 1992. ,
Performance Evaluntion of Decision Making Organisations Using Timed Petri Nets, 1986. ,
Analyse de fabrications non lin??aires et r??p??titives ?? l'aide de graphes d'??v??nements temporis??s, RAIRO - Operations Research, vol.22, issue.2, p.22, 1989. ,
DOI : 10.1051/ro/1988220201371
Performance Evaluation of Job-shop Systems tFifg Timed Event Graphs, IEEE Trans. on Automatic Control, vol.34, 1989. ,
lmproving Manufacturing Operations with WITNESS computer Simulation, AT&TTechnology, vol.6, issue.1, pp.6-21, 1991. ,
Synthesis of feedback control logic for a class of controlled Petri nets, IEEE Transactions on Automatic Control, vol.35, issue.5, pp.514-523, 1990. ,
DOI : 10.1109/9.53517
Analysis and Control of Discrete Event Systems Represented by Petri Nets, Lecture Notes in Control and Information Science, vol.88, issue.103, pp.5-134, 1988. ,
A review of synthesis techniques for Petri nets, [1990] Proceedings. Rensselaer's Second International Conference on Computer Integrated Manufacturing, pp.348-355, 1990. ,
DOI : 10.1109/CIM.1990.128124
Optimisation by simulated annealing, Science, vol.4598220, pp.671-680, 1983. ,
Synthesis of PlacelTransition Nets for Simulation and Contol of Manufacturing Systems, Proc. IFAC/IFORS Symposium Large Scale Systems, 1986. ,
Simulated Annealing : Theory and applications, Laarhoven et Aarts, vol.87, 1987. ,
DOI : 10.1007/978-94-015-7744-1
Graphes D'Évènements Déterministes et Stochastiques : Application aux S_ystèmes de Production, Thèse de doctorat, 1991. ,
Optimisation of invariant criteria for event graphs, IEEE Transactions on Automatic Control, vol.37, issue.5, 1992. ,
DOI : 10.1109/9.135488
Generalized Petri Net Reduction Method, IEEF Trans. on Systems, Man and Cybernerics, vol.87, issue.17 2, pp.297-303, 1987. ,
DOI : 10.1109/tsmc.1987.4309041
FMS scheduling using Petri nets and heuristic search, Proceedings 1992 IEEE International Conference on Robotics and Automation, 1992. ,
DOI : 10.1109/ROBOT.1992.220208
A Simple and Fast Algorithm to obtain all invariants of a Generalized Peti Ner, Lecture Notes in Computer Science, vol.85, issue.52, 1985. ,
Linear algebra in net theory, Net T!,çgty and Application Lecture Notes in Computer Science, vol.80, issue.84, 1980. ,
DOI : 10.1007/3-540-10001-6_24
A Tutorial on Witness, Proceedings of the 1990 Winter Simulation Conference, pp.177-186, 1990. ,
lntroduction to SLAM II and SLAMSYSTEM, Proceedings of the 1992 Winter Simulation Conference, pp.352-387, 1992. ,
An introduction to TCL and ï(, 1993. ,
lntroduction to Simulation with Siman, NJ, 1990. ,
Peti Net Theory and the Modeling, 1981. ,
Kommunikation mit Automaten of SystemsA Modular Petri Net Approach for Modeling Complex Manufacturing Systern.r, Proth 8th International Conference on CAD/CAM, Robotics and Factories of the Future, 1962. ,
Performance Evaluation and Optimisation of Stoclnstic timed Event Graphs, IEEE transactions on Automatic Conrol, 1993. ,
A class of Petri nets for manufacturing system integration, IEEE Transactions on Robotics and Automation, vol.13, issue.3 ,
DOI : 10.1109/70.585895
URL : https://hal.archives-ouvertes.fr/inria-00074617
Performance Evaluation of Asynchronous Concurrent Systems Using Petri Nets, IEEE Trans. on Software Engineering, vol.6, p.5, 1980. ,
A timed Petri ner ans beam search based online FMS scheduling with routing flexibiliry, Proceedings of the l99l IEEE international conference on robotics and automation, pp.2548-2553, 1991. ,
Petri Nets and Flexible Manufactwing Advances in Petri Nets 89, LNCS, vol.90, issue.424, pp.375-417, 1990. ,
A Method for Stepwise Refinement and Abstraction of Petri Nets, Journal of Computer and System Sciences, vol.83, issue.27, pp.51-73 ,
On the Hierarchical Modeling Analysis and Simulation of Flexible Manufacturing Systems with Extended Petri Nets, IEEE Trans. on Systems, Man and Cybernetics, vol.20, pp.94-110, 1990. ,
Arulysis of Peti Nets by Stepwise Refinemenrs, Journal of Computer and System Sciences, vol.79, issue.18, pp.35-46, 1979. ,
GRAMAN: a graphic Systemfor Manufacturing Systems Design, IMACS international Symposium on System Modeling and Simulation, 1988. ,
A top-down approach to systematic synthesis of Petri net models for manufacturing systems, Proceedings, 1989 International Conference on Robotics and Automation, pp.534-539, 1989. ,
DOI : 10.1109/ROBOT.1989.100041
nombre de lignes de la matrice d'incidence du sous-réseau maximal ; -nl : nombre de colonnes de la matrice d'incidence du sous-Éseau ma,ximal ; -entree : tableau identifiant les transitions d'entrée du sous-réseau maximal : 'softie : tableau identifiant les transitions de sortie du sous-réseau maximal : -n_sort : nombre de transitions de sortie du du sous-Éseau maximal ; -fîchier-: -no-m du fichier où sont stockés les t-invariants à supporr minimal associés à chacun de sous-réseaux obtenus après la décomposidôir. void Objet: void find-net (matrl, npl, ntl, pos, fichl) pbjet:. extraire un sous-téseau correspondant au suppon d'un t-invariant à suppon minimal. Paramètres : -matrl : matrice d'incidence du sous-dseau maximal ; -ttpl : nombre de lignes de la matrice d'incidence du sous-rÉseau maximal ,
Éseau maximal ; -npl : nombre de lignes de la matrice d'incide nce du sous-réseau maximal ; -ntl : nombre de colonnes de la matrice d'incidence du sous-réseau maximal ; -net: structure pour sauvegarder le sous-réseau ; -fîchl : nom du fichier où stocker les t-invariants associés au sous-réseau obtenu. cod_st_base (ntl, trs, cod) associer un nombre entier (un code) à chaque sous-réseau ,
de la maricË dles contrainte-s relatives à la demande des produits. Paramètres : -pt_matr: stuctue pour la sauvegarde de la matrice obtenue ; ' -nb_invar: nombre total de sous-Éseaux (t-invariants) utilisés ,