A. Agrawal, S. Akshay, B. Genest, and P. S. Thiagarajan, Approximate verification of the symbolic dynamics of markov chains, Proc. 27th Annual Symposium on Logic in Computer Science (LICS'12, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00920793

R. Alur and M. Bernadsky, Bounded Model Checking for GSMP Models of Stochastic Real-Time Systems, Proc. 9th International Workshop on Hybrid Systems: Computation and Control, pp.19-33, 2006.
DOI : 10.1007/3-540-45657-0_17

A. Abate, Probabilistic reachability for stochastic hybrid systems: theory, computations, and applications, 2007.

[. Abdulla, N. Bertrand, A. Rabinovich, and P. Schnoebelen, Verification of probabilistic systems with faulty communication Information and Computation, ACD93] Rajeev Alur, Costas Courcoubetis, and David L. Dill. Modelchecking in dense real-time. Information and Computation, pp.141-1652, 1993.

R. Alur and D. L. Dill, Automata for modeling real-time systems, Proc. 17th International Colloquium on Automata, Bibliography Languages and Programming (ICALP'90), pp.322-335, 1990.
DOI : 10.1007/BFb0032042

R. Alur and D. L. Dill, A theory of timed automata, Theoretical Computer Science, vol.126, issue.2, pp.183-235, 1994.
DOI : 10.1016/0304-3975(94)90010-8

[. Abate, J. Joost-pieter-katoen, M. Lygeros, and . Prandini, Approximate Model Checking of Stochastic Hybrid Systems, European Journal of Control, vol.16, issue.6, pp.624-641, 2010.
DOI : 10.3166/ejc.16.624-641

M. Bernadsky and R. Alur, Symbolic Analysis for GSMP Models with One Stateful Clock, Proc. 10th International Workshop on Hybrid Systems: Computation and Control, pp.90-103
DOI : 10.1007/978-3-540-71493-4_10
URL : http://www.seas.upenn.edu/~mbernads/Hscc07.pdf

C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer, Probabilistic and Topological Semantics for Timed Automata, Proc. 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), pp.179-191, 2007.
DOI : 10.1007/978-3-540-77050-3_15
URL : https://hal.archives-ouvertes.fr/inria-00424526

C. Baier, N. Bertrand, P. Bouyer, T. Brihaye, and M. Größer, Almost-Sure Model Checking of Infinite Paths in One-Clock Timed Automata, 2008 23rd Annual IEEE Symposium on Logic in Computer Science, pp.217-226, 2008.
DOI : 10.1109/LICS.2008.25
URL : https://hal.archives-ouvertes.fr/inria-00424520

N. Bertrand, P. Bouyer, T. Brihaye, Q. Menet, C. Baier et al., Stochastic Timed Automata, Logical Methods in Computer Science, vol.10, issue.4, pp.1-73, 2014.
DOI : 10.2168/LMCS-10(4:6)2014
URL : https://hal.archives-ouvertes.fr/hal-01102368

[. Bertrand, P. Bouyer, T. Brihaye, and P. Carlier, Analysing decisive stochastic processes, Proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), LIPIcs. Leibniz-Zentrum für Informatik, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01397794

N. Bertrand, P. Bouyer, T. Brihaye, and P. Carlier, When are stochastic transition systems tameable? Submitted for publication, 2017.

B. Bertrand, P. Bouyer, T. Brihaye, and N. Markey, Quantitative Model-Checking of One-Clock Timed Automata under Probabilistic Semantics, 2008 Fifth International Conference on Quantitative Evaluation of Systems, 2008.
DOI : 10.1109/QEST.2008.19
URL : https://hal.archives-ouvertes.fr/inria-00424518

[. Bouyer, T. Brihaye, P. Carlier, and Q. Menet, Compositional Design of Stochastic Timed Automata, Proc. 11th International Computer Science Symposium in Russia (CSR'16), volume 9691 of Lecture Notes in Computer Science, 2016.
DOI : 10.1007/s001650300009

[. Bouyer, T. Brihaye, M. Jurdzinski, and Q. Menet, Almost-Sure Model-Checking of Reactive Timed Automata, 2012 Ninth International Conference on Quantitative Evaluation of Systems, pp.138-147, 2012.
DOI : 10.1109/QEST.2012.10

P. [. Bohnenkamp, H. D-'argenio, J. Hermanns, and . Katoen, MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems, IEEE Transactions on Software Engineering, vol.32, issue.10, pp.812-830, 2006.
DOI : 10.1109/TSE.2006.104
URL : http://doc.utwente.nl/48984/1/0000011b.pdf

N. Bertrand, Modèles stochastiques pour les pertes de messages dans les protocoles asynchrones et techniques de vérification automatique, 2006.

B. Baier, H. Haverkort, J. Hermanns, and . Katoen, Model-checking algorithms for continuous-time markov chains, IEEE Transactions on Software Engineering, vol.29, issue.6, pp.524-541, 2003.
DOI : 10.1109/TSE.2003.1205180
URL : http://web.informatik.uni-bonn.de/I/baier/papers/BHHK03.pdf

J. Baier and . Katoen, Principles of Model Checking, 2008.

[. Brázdil, J. K. K?etínsk´k?etínsk´y, and V. , Fixed-Delay Events in Generalized Semi-Markov Processes Revisited, Proc. 22nd International Conference on Concurrency Theory, pp.140-155, 2011.
DOI : 10.1007/3-540-45657-0_17

[. Brihaye, Verification and Control of O-Minimal Hybrid Systems and Weighted Timed Automata, 2006.

[. Bohnenkamp and P. Van-der-stok, Holger Hermanns, and Frits Vaandrager. Cost-optimisation of the ipv4 zeroconf protocol, International conference on dependable systems and networks, 2003.

E. M. Clarke and E. Emerson, Design and synthesis of synchronization skeletons using branching time temporal logic, Proc. 3rd Workshop on Logics of Programs, pp.52-71, 1981.
DOI : 10.1007/BFb0025774

[. Cattani, R. Segala, Z. Marta, G. Kwiatkowska, and . Norman, Stochastic Transition Systems for Continuous State Spaces and Non-determinism, Proc. 8th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'05), pp.125-139, 2005.
DOI : 10.1007/978-3-540-31982-5_8
URL : http://profs.sci.univr.it/~segala/www/pub/CSKN05-FOSSACS.pdf

[. Courcoubetis and M. Yannakakis, Verifying temporal properties of finite-state probabilistic programs, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science, pp.338-345, 1988.
DOI : 10.1109/SFCS.1988.21950

R. D. Pedro, J. Argenio, and . Katoen, A theory of stochastic systems Part I: Stochastic automata, Information and Computation, vol.203, issue.1, pp.1-38, 2005.

R. D. Pedro, J. Argenio, and . Katoen, A theory of stochastic systems Part II: Process algebra, Information and Computation, vol.203, issue.1, pp.39-74, 2005.

J. Desharnais and P. Panangaden, Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes, The Journal of Logic and Algebraic Programming, vol.56, issue.1-2, pp.99-115, 2003.
DOI : 10.1016/S1567-8326(02)00068-1
URL : https://doi.org/10.1016/s1567-8326(02)00068-1

[. Feller, An Introduction to Probability Theory and Its Applications, 1966.

[. Feller, An Introduction to Probability Theory and Its Applications, 1969.

E. Fhh-+-11-]-martin-fränzle, H. Moritz-hahn, N. Hermanns, L. Wolovick, and . Zhang, Measurability and safety verification for stochastic hybrid systems, Proc. 14th ACM International Conference on Hybrid Systems: Computation and Control (HSCC'11), pp.43-52, 2011.

[. Gburek, C. Baier, and S. Klüppelholz, Composition of stochastic transition systems, Proc. 43rd International Colloquium on Automata, Languages and Programming (ICALP'16), LIPIcs. Leibniz-Zentrum für Informatik, 2016.

W. Peter and . Glynn, A GSMP formalism for discrete event systems, Proc. of the IEEE, pp.14-23, 1989.

A. R. Charles, S. D. Hoare, A. W. Brookes, and . Roscoe, A theory of communicating sequential processes, Journal of the ACM, vol.31, issue.3, pp.560-599, 1984.

A. Thomas and . Henzinger, The theory of hybrid automata, Proc. 11th Annual Symposim on Logic in Computer Science (LICS'96), pp.278-292, 1996.

[. Hermanns, Interactive Markov Chains: The Quest for Quantified Quality, Lecture Notes in Computer Science, vol.2428, 2002.

H. [. Hartmanns and . Hermanns, The Modest Toolset: An Integrated Environment for Quantitative Modelling and Verification, Bibliography Proc. 20th International Conference on Tools, pp.593-598, 2009.
DOI : 10.1007/978-3-642-54862-8_51

J. Hu, J. Lygeros, and S. Sastry, Towards a Theory of Stochastic Hybrid Systems, Proc. 3rd International Conference on Hybrid Systems: Computation and Control (HSCC'00), pp.160-173, 2000.
DOI : 10.1007/3-540-46430-1_16

[. Horváth, M. Paolieri, L. Ridi, and E. Vicario, Transient analysis of non-markovian models using stochastic state classes. Performance Evaluation, pp.315-335, 2012.

[. Hermanns and L. Zhang, From concurrency models to numbers ? Performance and dependability. In Software and Systems Safety ? Specification and Verification, volume 30 of NATO Science for Peace and Security Series -D: Information and Communication Security, pp.182-210, 2011.

[. Kwiatkowska, G. Norman, and D. Parker, PRISM 4.0: Verification of Probabilistic Real-Time Systems, Proc. 23rd International Conference on Computer Aided Verification (CAV'11), pp.585-591
DOI : 10.1007/3-540-45657-0_17
URL : https://hal.archives-ouvertes.fr/hal-00648035

M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, Verifying Quantitative Properties of Continuous Probabilistic Timed Automata, Proc. 11th International Conference on Concurrency Theory, pp.123-137, 2000.
DOI : 10.1007/3-540-44618-4_11

M. Z. Kwiatkowska, G. Norman, R. Segala, and J. Sproston, Automatic verification of real-time systems with discrete probability distributions, Theoretical Computer Science, vol.282, issue.1, pp.101-150, 2002.
DOI : 10.1016/S0304-3975(01)00046-9

J. G. Kemeny, J. L. Snell, and A. W. Knapp, Denumerable Markov Chains, Graduate Texts in Mathematics, vol.40, p.265, 1976.
DOI : 10.1007/978-1-4684-9455-6

M. Krichen and S. Tripakis, State Identification Problems for Timed Automata, Proc. 17th IFIP International Conference on Testing of Communicating Systems (TESTCOM'05), pp.175-191
DOI : 10.1023/A:1008734703554
URL : http://www-verimag.imag.fr/PEOPLE/tripakis/papers/testcom05b.pdf

[. Laroussinie, N. Markey, and P. Schnoebelen, Model Checking Timed Automata with One or Two Clocks, Proc. 15th International Conference on Concurrency Theory, pp.387-401, 2004.
DOI : 10.1007/3-540-45931-6_19
URL : https://hal.archives-ouvertes.fr/hal-01194617

G. Kim, A. Larsen, and . Skou, Bisimulation through probabilistic testing, Information and Computation, vol.94, pp.1-28, 1991.

G. Kim, W. Larsen, and . Yi, Time abstracted bisimulation: Implicit specifications and decidability, Proc. 9th Conf. Mathematical Foundations of Programming Semantics, pp.160-176, 1993.

[. Panangaden, Measure and probability for concurrency theorists, Theoretical Computer Science, vol.253, issue.2, pp.287-309, 2001.
DOI : 10.1016/S0304-3975(00)00096-7
URL : https://doi.org/10.1016/s0304-3975(00)00096-7

[. Panangaden, Labelled Markov Processes, 2009.
DOI : 10.1142/p595

J. Peterson, Petri Net Theory and the Modeling of Systems, 1981.

[. Paolieri, A. Horváth, and E. Vicario, Probabilistic Model Checking of Regenerative Concurrent Systems, IEEE Transactions on Software Engineering, vol.42, issue.2, pp.153-169, 2016.
DOI : 10.1109/TSE.2015.2468717
URL : https://iris.unito.it/bitstream/2318/1603291/1/bolgheri.pdf

A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

A. Pnueli, On the extremely fair treatment of probabilistic algorithms, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.278-290, 1983.
DOI : 10.1145/800061.808757

[. Queille and J. Sifakis, Specification and verification of concurrent systems in CESAR, Proc. 5th International Symposium on Programming, pp.337-351, 1982.
DOI : 10.1007/3-540-11494-7_22

O. Michael, D. Rabin, and . Scott, Finite automata and their decision problems, IBM Journal of Research and Developments, vol.3, pp.115-125, 1959.

[. Soudjani and A. Abate, Adaptive and Sequential Gridding Procedures for the Abstraction and Verification of Stochastic Processes, SIAM Journal on Applied Dynamical Systems, vol.12, issue.2, pp.921-956, 2013.
DOI : 10.1137/120871456

M. Y. Vardi, Automatic verification of probabilistic concurrent finite state programs, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985), pp.327-338, 1985.
DOI : 10.1109/SFCS.1985.12

Y. Moshe, P. Vardi, and . Wolper, Reasoning about infinite computations, Information and Computation, vol.115, issue.1, pp.1-37, 1994.

. Sujet-de-la-thèse, nous nous intéressonsintéressonsà la vérification d'automates temporisés et stochastiques (´ ecrits STA pour la suite) La vérification de systèmes informatiques est devenue courante de nos jours : certains de ces systèmes pouvantêtrepouvantêtre critiques (avions, centrales nucléaires, ...), il est important de pouvoir vérifier si ces systèmes fonctionnent correctement. Cela se fait par le biais d'une modélisation mathématique du système, Ces modèles mathématiques nous fournissent des outils qui permettent de décider si un système est correct

´. En-particulier and . Etant-donné-un-modèle, un système informatique) et une propriété (exprimée sur le modèle mathématique), on veut pouvoir vérifier si le modèle satisfait la propriété