P. Aziz-abdulla, M. F. Atig, and J. Cederberg, Timed lossy channel systems, Proc. 31sth Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'12), volume 18 of LIPIcs Schloss Dagstuhl ? Leibniz-Zentrum fuer Informatik, pp.374-386, 2012.

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/11730637_5

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

C. Baier, Reasoning About Cost-Utility Constraints in Probabilistic Models, Proc. 9th Workshop on Reachability Problems in Computational Models (RP'15), pp.1-6, 2015.
DOI : 10.1007/978-3-319-24537-9_1

C. Baier, B. Haverkort, H. Hermanns, and J. 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

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, 2007.
DOI : 10.1007/978-3-540-71493-4_10

N. 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

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

T. Brázdil, J. K. K?etínský, and V. ?ehák, Fixed-Delay Events in Generalized Semi-Markov Processes Revisited, Proc. 22nd International Conference on Concurrency Theory (CONCUR'11), pp.140-155, 2011.
DOI : 10.1214/154957804100000024

L. Clemente, F. Herbreteau, A. Stainer, and G. Sutre, Reachability of Communicating Timed Processes, Proc. 16th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'13), pp.81-96, 2013.
DOI : 10.1007/978-3-642-37075-5_6
URL : https://hal.archives-ouvertes.fr/hal-00744085

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

W. Peter and . Glynn, A GSMP formalism for discrete event systems, Proceedings of the IEEE, vol.77, issue.1, pp.14-23, 1989.

R. Geoffrey, D. R. Grimmett, and . Stirzaker, Probability and Random Processes, Analysing Decisive Stochastic Processes 14, 1992.

E. Moritz-hahn, H. Hermanns, B. Wachter, and L. Zhang, Time-bounded model checking of infinite-state continuous-time Markov chains, Fundamenta Informaticae, vol.95, issue.1, pp.129-155, 2009.

R. A. Howard, Dynamic Probabilistic Systems, Volume II: Semi-Markov and Decision Processes, 1971.

P. Iyer and M. Narasimha, Probabilistic lossy channel systems, Proc. 7th International Joint Conference on Theory and Practice of Software Development (TAPSOFT'97, pp.667-681, 1997.
DOI : 10.1007/BFb0030633

S. Soudjani, R. Majumdar, and A. Abate, Safety Verification of Continuous-Space Pure Jump Markov Processes, Proc. 22nd International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'16), pp.147-163, 2016.
DOI : 10.1007/978-3-662-49674-9_9