B. S. Akshay, P. Bollig, M. Gastin, K. Mukund, . Narayan et al., Distributed Timed Automata with Independently Evolving Clocks, LNCS, vol.5201, pp.82-97, 2008.
DOI : 10.1007/978-3-540-85361-9_10
URL : https://hal.archives-ouvertes.fr/hal-01089524

R. Alur and D. Dill, Automata for modeling real-time systems, LNCS, vol.443, pp.322-335, 1990.
DOI : 10.1007/BFb0032042

R. Alur and D. 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

S. Balaguer and T. Chatain, Avoiding shared clocks in networks of timed automata, CONCUR 2012, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00706608

]. Bérard, F. Cassez, S. Haddad, D. Lime, and O. H. Roux, Comparison of the Expressiveness of Timed Automata and Time Petri Nets, LNCS, vol.3829, pp.211-225, 2005.
DOI : 10.1007/11603009_17

S. Balaguer, T. Chatain, and S. Haar, A concurrency-preserving translation from time Petri nets to networks of timed automata, p.2012
URL : https://hal.archives-ouvertes.fr/hal-00776605

[. Bouyer, C. Dufourd, E. Fleury, and A. Petit, Updatable timed automata, Theoretical Computer Science, vol.321, issue.2-3, pp.291-345, 2004.
DOI : 10.1016/j.tcs.2004.04.003
URL : https://hal.archives-ouvertes.fr/hal-00350196

E. Best, R. R. Devillers, A. Kiehn, and L. Pomello, Concurrent bisimulations in Petri nets, Acta Informatica, vol.XI, issue.3, pp.231-264, 1991.
DOI : 10.1007/BF01178506

M. Bozga, C. Daws, O. Maler, A. Olivero, S. Tripakis et al., Kronos: a model-checking tool for real-time systems, LNCS, vol.1427, pp.546-550, 1998.
URL : https://hal.archives-ouvertes.fr/hal-00374788

P. Bouyer, D. Deepak, P. Souza, A. Madhusudan, and . Petit, Timed Control with Partial Observability, CAV 2003, pp.180-192, 2003.
DOI : 10.1007/978-3-540-45069-6_18

P. Bouyer, S. Haddad, and P. Reynier, Timed Unfoldings for Networks of Timed Automata, ATVA 2006, pp.292-306, 2006.
DOI : 10.1007/11901914_23

J. Bengtsson, B. Jonsson, J. Lilius, and W. Yi, Partial order reductions for timed systems, In CONCUR LNCS, vol.1466, pp.485-500, 1998.
DOI : 10.1007/BFb0055643

M. Boyer and O. H. Roux, On the compared expressiveness of arc, place and transition time Petri nets, Fundam. Inform, vol.88, issue.3, pp.225-249, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00489072

I. Cassez, T. Chatain, and C. Jard, Symbolic Unfoldings for Networks of Timed Automata, ATVA 2006, pp.307-321, 2006.
DOI : 10.1007/11901914_24
URL : https://hal.archives-ouvertes.fr/inria-00363033

K. Cerans, J. Chr, K. Godskesen, and . Larsen, Timed Modal Specification ???Theory and Tools, BRICS Report Series, vol.4, issue.11, pp.253-267, 1993.
DOI : 10.7146/brics.v4i11.18802
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3202

[. Cassez and O. H. Roux, Structural translation from time Petri nets to timed automata, Jour. of Systems and Software, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00139236

C. Dima, Positive and Negative Results on the Decidability of the Model-Checking Problem for an Epistemic Extension of Timed CTL, 2009 16th International Symposium on Temporal Representation and Reasoning, pp.29-36, 2009.
DOI : 10.1109/TIME.2009.21

[. Dima and R. Lanotte, Distributed Time-Asynchronous Automata, ICTAC 2007, pp.185-200, 2007.
DOI : 10.1007/978-3-540-75292-9_13
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.278.6585

A. David, K. G. Larsen, S. Li, and B. Nielsen, Timed Testing under Partial Observability, 2009 International Conference on Software Testing Verification and Validation, pp.61-70, 2009.
DOI : 10.1109/ICST.2009.38
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.204.8788

J. Y. Halpern, R. Fagin, Y. Moses, and M. Y. Vardi, Reasoning About Knowledge, 1995.

[. Lugiez, P. Niebert, and S. Zennou, A partial order semantics approach to the clock explosion problem of timed automata, Theoretical Computer Science, vol.345, issue.1, pp.27-59, 2005.
DOI : 10.1016/j.tcs.2005.07.023

K. G. Larsen, P. Pettersson, and W. Yi, Uppaal in a nutshell, International Journal on Software Tools for Technology Transfer, vol.1, issue.1-2, pp.134-152, 1997.
DOI : 10.1007/s100090050010

D. [. Merlin and . Farber, Recoverability of communication protocols ? implications of a theorical study, IEEE Transactions on Communications, vol.24, 1976.

M. Minea, Partial Order Reduction for Model Checking of Timed Automata, LNCS, vol.1664, pp.431-446, 1999.
DOI : 10.1007/3-540-48320-9_30

J. Reif, The complexity of two-player games of incomplete information, Journal of Computer and System Sciences, vol.29, issue.2, pp.274-301, 1984.
DOI : 10.1016/0022-0000(84)90034-5

J. Srba, Comparing the Expressiveness of Timed Automata and Timed Extensions of Petri Nets, LNCS, vol.5215, pp.15-32, 2008.
DOI : 10.1007/978-3-540-85778-5_3

R. J. Van-glabbeek and U. Goltz, Refinement of actions and equivalence notions for concurrent systems, Acta Informatica, vol.37, issue.4-5, pp.229-327, 2001.
DOI : 10.1007/s002360000041

[. Wozna and A. Lomuscio, A logic for knowledge, correctness, and real time, CLIMA 2004, pp.1-15, 2004.