. Glossaire-réseau-d, automates stochastiques : chaîne de Markov à N composantes, comportant N automates stochastiques et un ensemble d'événements (page 37). taux de franchissement : définition 1 page 38. transition : définie par un état de départ, un événement et une probabilité de routage, pp.38-45

.. Exemple-d-'événement-local, 30 2.2 L'exclusion mutuelle, événements, p.32

]. S. Bibliographie1, F. Alouf, P. Huet, and . Nain, Forwarders vs. centralized server : an evaluation of two approaches for locating mobile agents, Performance Evaluation, vol.49, pp.299-319, 2002.

K. Atif, Modélisation du parallélisme et de la synchronisation, 1992.

F. Bause, P. Buchholz, and P. Kemper, A Toolbox for functionnal and quantitative analysis of DEDS (extended abstract), Proc. 10th. int. conf. Computer Performance evaluation, Modelling Techniques and Tools, 1998.

A. Benoit, L. Brenner, P. Fernandes, and B. Plateau, Aggregation of stochastic automata networks with replicas, Linear Algebra and its Applications, vol.386, 2003.
DOI : 10.1016/j.laa.2004.02.015
URL : https://hal.archives-ouvertes.fr/hal-00807384

A. Benoit, L. Brenner, P. Fernandes, B. Plateau, and W. J. Stewart, The Peps Software Tool, 2003.
DOI : 10.1007/978-3-540-45232-4_7
URL : https://hal.archives-ouvertes.fr/hal-00807383

A. Benoit, P. Fernandes, B. Plateau, and W. J. Stewart, On the Benefits of Using Functional Transitions in Kronecker Modelling, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00807287

A. Benoit, B. Plateau, and W. J. Stewart, Memory Efficient Iterative Methods for Stochastic Automata Networks, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072328

A. Benoit, B. Plateau, and W. J. Stewart, Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems, 2003.
URL : https://hal.archives-ouvertes.fr/hal-00807385

M. Bozga and O. Maler, On the Representation of Probabilities over Structured Domains, Proc. CAV'99, pp.261-273, 1999.
DOI : 10.1007/3-540-48683-6_24
URL : https://hal.archives-ouvertes.fr/hal-00369366

P. Buchhloz, Hierarchical structuring of Superposed GSPNs, Proc. 7th Int. Workshop on Petri Nets and Performance Models PNPM'97, pp.81-90, 1997.

P. Buchholz, Aggregation and reduction techniques for hierarchical GCSPNs, Proceedings of 5th International Workshop on Petri Nets and Performance Models, pp.216-225, 1993.
DOI : 10.1109/PNPM.1993.393449

P. Buchholz, Hierarchical Markovian Models -Symmetries and Reduction Performance Evaluation'92 : Modelling Techniques and Tools, 13] P. Buchholz. A Class of Hierarchical Queueing Networks and Their Analysis. Queueing Systems, pp.234-24659, 1993.
DOI : 10.1016/0166-5316(93)e0040-c
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.29.8843

P. Buchholz, Exact and ordinary lumpability in finite Markov chains, Journal of Applied Probability, vol.1, issue.01, pp.59-75, 1994.
DOI : 10.1016/0166-5316(88)90031-4

P. Buchholz, Equivalence Relations for Stochastic Automata Networks, Proc. 2nd int. workshop on the numerical solution of Markov chains, 1995.
DOI : 10.1007/978-1-4615-2241-6_13

P. Buchholz, An Aggregation/Disaggregation Algorithm for Stochastic Automata Networks, Probability in the Engineering and Informational Sciences, pp.229-253, 1997.
DOI : 10.1137/0724062

P. Buchholz, An adaptive aggregation/disaggregation algorithm for hierarchical Markovian models, European Journal of Operational Research, vol.116, issue.3, pp.545-564, 1999.
DOI : 10.1016/S0377-2217(98)00088-5

P. Buchholz, Exact performance equivalence: An equivalence relation for stochastic automata, Theoretical Computer Science, vol.215, issue.1-2, pp.239-261, 1999.
DOI : 10.1016/S0304-3975(98)00169-8

P. Buchholz, Projection methods for the analysis of stochastic automata networks, Proc. 3rd int. workshop on the numerical solution of Markov chains, 2000.

P. Buchholz, G. Ciardo, S. Donatelli, and P. Kemper, Complexity of Memory-Efficient Kronecker Operations with Applications to the Solution of Markov Models, INFORMS Journal on Computing, vol.12, issue.3, pp.203-222, 2000.
DOI : 10.1287/ijoc.12.3.203.12634

P. Buchholz, M. Fisher, and P. Kemper, Distributed steady state analysis using Kronecker algebra, Proc. 3rd int. workshop on the numerical solution of Markov chains, 2000.

P. Buchholz and P. Kemper, Efficient Computation and Representation of Large Reachability Sets for Composed Automata, Proc. 5th workshop on Discrete Event Systems, 2000.
DOI : 10.1007/978-1-4615-4493-7_4

J. Campos, M. Silva, and S. Donatelli, Structured solution of stochastic DSSP systems, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, pp.91-100, 1997.
DOI : 10.1109/PNPM.1997.595540

R. Chan and W. Ching, Circulant preconditionners for stochastic automata networks, 1998.

G. Chiola, S. Donatelli, and G. Franceschinis, GSPNs versus SPNs: what is the actual role of immediate transitions?, Proceedings of the Fourth International Workshop on Petri Nets and Performance Models PNPM91, 1991.
DOI : 10.1109/PNPM.1991.238785

G. Chiola, G. Franceschini, R. Gaeta, and M. Ribaudo, GreatSPN 1.7: Graphical editor and analyzer for timed and stochastic Petri nets, Performance Evaluation, vol.24, issue.1-2, 1996.
DOI : 10.1016/0166-5316(95)00008-L

G. Ciardo, Discrete-Time Markovian Stochastic Petri Nets, Computation with Markov Chains, pp.339-358, 1995.
DOI : 10.1007/978-1-4615-2241-6_20

G. Ciardo, R. German, and C. Lindemann, A characterization of the stochastic process underlying a stochastic Petri net, IEEE Transactions on Software Engineering, vol.20, issue.7, pp.506-515, 1994.
DOI : 10.1109/32.297939

G. Ciardo, R. L. Jones, A. S. Miner, and R. Siminiceanu, SMART : Stochastic Model Analyzer for Reliability and Timing, Tools of Aachen 2001 International Multiconference on Measurement, Modelling and Evaluation of Computer- Communication Systems, pp.29-34, 2001.

G. Ciardo and A. S. Miner, Storage alternatives for large structured state spaces, Proc. 9th Int. Conf. on Modelling Techniques and Tools for Computer Performance Evaluation, pp.44-57, 1997.
DOI : 10.1007/BFb0022196

G. Ciardo and A. S. Miner, A data structure for the efficient Kronecker solution of GSPNs, Proceedings 8th International Workshop on Petri Nets and Performance Models (Cat. No.PR00331), 1999.
DOI : 10.1109/PNPM.1999.796529

G. Ciardo and A. S. Miner, Efficient reachability set generation and storage using decision diagram, proc. 20th int. Conf. Application and Theory of Petri Nets, 1999.

G. Ciardo and R. Zijal, Well-defined stochastic Petri nets, Proceedings of MASCOTS '96, 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp.278-284, 1996.
DOI : 10.1109/MASCOT.1996.501031

M. Davio, Kronecker products and shuffle algebra, IEEE Transactions on Computers, vol.30, issue.2, pp.116-125, 1981.
DOI : 10.1109/TC.1981.6312174

T. Dayar and E. Uysal, Iterative methods based on splittings for stochastic automata networks, European Journal of Operation Research, vol.110, issue.2, pp.166-186, 1998.

D. D. Deavours and W. H. Sanders, On-The-Fly " Solution Techniques for Stochastic Petri Nets and Extensions, Proceedings of the Seventh International Workshop on Petri Nets and Performance Models, pp.132-141, 1997.

D. D. Deavours and W. H. Sanders, An efficient disk-based tool for solving large Markov models, Performance Evaluation, vol.33, issue.1, pp.67-84, 1998.
DOI : 10.1016/S0166-5316(98)00010-8

S. Donatelli, Superposed stochastic automata: a class of stochastic Petri nets with parallel solution and distributed state space, Performance Evaluation, vol.18, issue.1, pp.21-36, 1993.
DOI : 10.1016/0166-5316(93)90025-P

S. Donatelli, Superposed Generalized Stochastic Petri Nets: Definition and efficient solution, Proceedings 15th International Conference, pp.258-277, 1994.
DOI : 10.1007/3-540-58152-9_15

C. Durbach, F. Quessette, and A. Troubnikoff, Solving Large Markov Model based on Stochastic automata networks [41] P. Fernandes. Méthodes Numériques pour la solution de systèmes Markoviens à grand espace d'états, Proc. Advances in Computer and Information Sciences'98, 1998.

P. Fernandes, B. Plateau, and W. J. Stewart, Efficient descriptor-vector multiplications in stochastic automata networks, Journal of the ACM, vol.45, issue.3, pp.381-414, 1998.
DOI : 10.1145/278298.278303
URL : https://hal.archives-ouvertes.fr/inria-00073764

P. Fernandes, B. Plateau, and W. J. Stewart, Optimizing tensor product computations in, Stochastic Automata Networks. RAIRO, Operations Research, pp.325-351, 1998.

J. Fourneau, Réseaux d'automates stochastiques : Exemples et Applications aux télécommunications, Proc. Ecole d'informatique des systèmes parallèles et répartis, 1997.

J. Fourneau, Stochastic Automata Networks : Using structural properties to reduce the state space, Proc. 3rd int. workshop on the numerical solution of Markov chains, 2000.

J. Fourneau, K. Lee, and B. Plateau, PEPS : A package for solving complex Markov models of parallel systems, Proceedings of the Fourth International Conference on Modelling Techniques and Tools for Computer Performance Evaluation, pp.291-305, 1988.

J. Fourneau and F. Quessette, Graphs and Stochastic Automata Networks, Proc. 2nd int. workshop on the numerical solution of Markov chains, 1995.
DOI : 10.1007/978-1-4615-2241-6_14

H. Garavel and H. Hermanns, On Combining Functional Verification and Performance Evaluation Using CADP, 2002.
DOI : 10.1007/3-540-45614-7_23
URL : https://hal.archives-ouvertes.fr/inria-00072096

E. Gelenbe and I. Mitrani, Analysis and synthesis of computer systems, 1980.
DOI : 10.1142/p643

E. Gelenbe and G. Pujolle, Introduction to Queueing Networks, second edition, 1998.

C. Ghezzi, D. Mandrioli, S. Morasca, and M. Pezze, A general way to put time in petri nets, Proc. 5th Int. Workshop on Software Specification, pp.60-67, 1989.

J. Granata, M. Conner, and R. Tolimeri, Recursive fast algorithm and the role of the tensor product, IEEE Transactions on Signal Processing, vol.40, issue.12, pp.2921-2930, 1992.
DOI : 10.1109/78.175736

O. Gusak and T. Dayar, Discrete-time stochastic automata networks and their efficient analysis. Accepted for publication in Performance Evaluation, 2002.

O. Gusak, T. Dayar, and J. Fourneau, Stochastic Automata Networks and Near Complete Decomposability, Stochastic Automata Networks and Near Complete Decomposability, pp.581-599, 2001.
DOI : 10.1137/S089547980036975X
URL : https://hal.archives-ouvertes.fr/hal-01309483

O. Gusak, T. Dayar, and J. Fourneau, Lumpable continuous-time stochastic automata networks, European Journal of Operational Research, vol.148, issue.2, 2001.
DOI : 10.1016/S0377-2217(02)00431-9

H. Hermanns, U. Herzog, U. Klehmet, V. Mertsiotakis, and M. Siegle, Compositionnal Performance Modelling with TIPtool, Proc. 10th Conf. Computer performance Evaluation : Modelling Techniques and Tools, Springer LNCS 1469, 1998.

H. Hermanns, J. Meyer-kayser, and M. Siegle, Multi Terminal Binary Decision Diagram to Represent and Analyse Continuous Time Markov Chains, Proc. 3rd int. workshop on the numerical solution of Markov chains, 2000.

J. Hillston, Compositional Markovian Modelling Using a Process Algebra, Numerical Solution of Markov Chains., Kluwer, 1995.
DOI : 10.1007/978-1-4615-2241-6_12

J. Hillston and L. Kloul, An Efficient Kronecker Representation for PEPA Models, Proceedings of the first joint PAPM-PROBMIV Workshop, 2001.
DOI : 10.1007/3-540-44804-7_8

C. Hirel, B. Tuffin, and K. Trivedi, SPNP: Stochastic Petri Nets. Version 6.0, Proc. 11th Conf. Computer performance Evaluation : Modelling Techniques and Tools, Springer LNCS 1786, 2000.
DOI : 10.1007/3-540-46429-8_30

M. A. Holliday and M. K. Vernon, A Generalized Timed Petri Net Model for Performance Analysis, IEEE Transactions on Software Engineering, vol.13, issue.12, pp.1297-1310, 1987.
DOI : 10.1109/TSE.1987.233141

J. Katoen, M. Kwiatkowska, G. Norman, and D. Parker, Faster and Symbolic CTMC Model Checking, Lecture Notes in Computer Science, p.2165, 2001.
DOI : 10.1007/3-540-44804-7_2

J. G. Kemeny and J. L. Snell, Finite Markov Chains, 1960.

J. G. Kemeny and J. L. Snell, Finite Markov Chains, 1976.

P. Kemper, Numerical Analysis of superposed GSPNs, IEEE Trans. on Software Engineering, vol.22, issue.9, 1996.

P. Kemper, Reachability analysis based on structured representations, Proc. 17th int. conf. Application and Theory of Petri Nets, Springer LNCS 1091, pp.269-288, 1996.
DOI : 10.1007/3-540-61363-3_15

P. Kemper, Transient Analysis of Superposed GSPNs, Proc. Petri Nets and Performance Models, PNPM'97, 1997.

P. King and R. Pooley, Derivation of Petri Nets Performance Models from UML Specifications, Proc. 11th Conf. Computer performance Evaluation : Modelling Techniques and Tools, Springer LNCS 1786, 2000.

P. Lascaux and R. Théodor, Analyse numérique matricielle appliquée à l'art de l'ingénieur. Masson, 1994. [71] J. Ledoux. On weak lumpability of denumerable markov chains, 1995.

J. Ledoux, Weak lumpability of finite markov chains and positive invariance of cones, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073889

M. A. Marsan, G. Balbo, G. Conte, S. Donatelli, and G. Franceschinis, Modelling with Generalized Stochastic Petri Nets, ACM SIGMETRICS Performance Evaluation Review, vol.26, issue.2, 1995.
DOI : 10.1145/288197.581193

W. Massey, Open networks of queues : Their algebraic structure and estimating their transient behavior, Advances in Applied Probability, vol.16, issue.1, 1984.

A. S. Miner, Efficient solution of GSPNs using canonical matrix diagrams, Proceedings 9th International Workshop on Petri Nets and Performance Models, pp.101-110, 2001.
DOI : 10.1109/PNPM.2001.953360

A. S. Miner, G. Ciardo, and S. Donatelli, Using the exact state space of a Markov model to compute approximate stationary measures, Measurement and Modeling of Computer Systems, pp.207-216, 2000.

M. K. Molloy, Discrete Time Stochastic Petri Nets, IEEE Transactions on Software Engineering, vol.11, issue.4, pp.417-423, 1985.
DOI : 10.1109/TSE.1985.232230

J. K. Muppala, G. Ciardo, and K. S. Trivedi, Modeling Using Stochastic Reward Nets, MASCOTS'93 International Workshop on Modeling, pp.367-372

D. R. Musser and A. Saini, STL Tutorial and Reference Guide, 1996.

B. Plateau, De l'Evaluation du parallélisme et de la synchronisation, 1984.

B. Plateau, On the stochastic structure of parallelism and synchronization models for distributed algorithms, Proc. ACM Sigmetrics Conference on Measurement and Modelling of Computer Systems, 1985.

B. Plateau and K. Atif, Stochastic automata network of modeling parallel systems, IEEE Transactions on Software Engineering, vol.17, issue.10, pp.1093-1108, 1991.
DOI : 10.1109/32.99196

M. Rosenblatt, Functions of a Markov Process That are Markovian, Indiana University Mathematics Journal, vol.8, issue.4, pp.585-596, 1959.
DOI : 10.1512/iumj.1959.8.58039

Y. Saad, Iterative Methods for Sparse Linear Systems, 1996.
DOI : 10.1137/1.9780898718003

W. H. Sanders and J. F. Meyer, Reduced base model construction methods for stochastic activity networks, IEEE Journal on Selected Areas in Communications, vol.9, issue.1, pp.25-36, 1991.
DOI : 10.1109/49.64901
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3447

M. Siegle, Structured Markovian Performance Modelling with Automatic Symmetry Exploitation, Proc. 11th Conf. Computer performance Evaluation : Modelling Techniques and Tools, 1994.

M. Siegle, Using structured modelling for efficient performance prediction of parallel systems, Parallel Computing, pp.453-460, 1994.

R. Stansifer and D. Marinescu, Petri net models of concurrent Ada programs, Microelectronics Reliability, vol.31, issue.4, pp.577-594, 1991.
DOI : 10.1016/0026-2714(91)90004-Q

W. J. Stewart, An introduction to numerical solution of Markov chains, 1994.

W. J. Stewart, MARCA : Markov chain analyzer, a software package for Markov modelling, Numerical Solution of Markov Chains, 1991.

B. Stroustrup, The C++ Programming Language, 1991.

C. Tadonki and B. Philippe, Parallel Multiplication of a Vector by a Kronecker product of Matrices, Journal of Parallel and Distributed Computing and Practices, vol.2, issue.4, 1999.

C. Tadonki and B. Philippe, Méthodologie de conception d'algorithmes efficaces pour le produit tensoriel, 2000.

C. Tadonki and B. Philippe, Parallel Multiplication of a Vector by a Kronecker product of Matrices (Part II), Journal of Parallel and Distributed Computing and Practices, vol.3, issue.3, 2000.

F. Valois, Modélisation et Evaluation de Performances de Réseaux Cellulaires Hiérarchiques, 2000.

V. Vèque and J. Ben-othman, MRAP: A multiservices resource allocation policy for wireless ATM network, Computer Networks and ISDN Systems, vol.29, issue.17-18, pp.17-182187, 1998.
DOI : 10.1016/S0169-7552(97)00122-0

R. Zijal and G. Ciardo, Discrete Time Deterministic and Stochastic Petri Nets, 1996.
DOI : 10.1007/978-94-011-0187-5_8

R. Zijal and R. German, A new approach to discrete time stochastic Petri nets, Proc. 11th Int. Conf. on Analysis and Optimization of Systems, pp.198-204, 1996.
DOI : 10.1007/BFb0033549

A. Zimmermann, J. Freiheit, and G. Hommel, Discrete time stochastic petri nets for modeling and evaluation of real-time systems, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, 2001.
DOI : 10.1109/IPDPS.2001.925065

W. M. Zuberek, Timed Petri nets definitions, properties, and applications, Microelectronics Reliability, vol.31, issue.4, pp.627-644, 1991.
DOI : 10.1016/0026-2714(91)90007-T