M. Abadi and L. Lamport, An old-fashined recipe for real-time

J. R. Abrial, B#: Toward a Synthesis between Z and B, Lecture Notes in Computer Science, vol.2651, pp.168-177, 2003.
DOI : 10.1007/3-540-44880-2_12

J. R. Abrial and D. Cansell, Click???n Prove: Interactive Proofs within Set Theory, Lecture Notes in Computer Science, vol.2758, pp.1-24
DOI : 10.1007/10930755_1
URL : https://hal.archives-ouvertes.fr/inria-00099836

J. R. Abrial, D. Cansell, and D. Méry, A mechanically proved and incremental development of IEEE 1394 tree identify protocol . Formal Asp, Comput, vol.14, issue.3, pp.215-227, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099531

J. R. Abrial, D. Cansell, and D. Méry, A mechanically proved and incremental development of ieee 1394 tree identify protocol . Formal Asp, Comput, vol.14, issue.3, pp.215-227, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099531

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

D. Beauquier, T. Crolard, and E. Prokofieva, Automatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic, Lecture Notes in Computer Science, vol.2988, pp.372-387, 2004.
DOI : 10.1007/978-3-540-24730-2_29

D. Cansell, D. M-`-ery, and J. Rehm, Time Constraint Patterns for Event B Development, Formal Specification and Development in B, vol.4355, pp.140-154, 2006.
DOI : 10.1007/11955757_13
URL : https://hal.archives-ouvertes.fr/hal-00149163

S. Colin, ContributionàContribution`Contributionà l'intégration de temporalité au formalisme b : Utilisation du calcul des durées en tant que sémantique temporelle pour b, 2006.

S. Colin, G. Mariano, and V. Poirriez, Duration Calculus: A Real-Time Semantic for B, Lecture Notes in Computer Science, vol.3407, pp.431-446
DOI : 10.1007/978-3-540-31862-0_31

B. Dutertre and M. Sorea, Modeling and Verification of a Fault-Tolerant Real-Time Startup Protocol Using Calendar Automata, Lecture Notes in Computer Science, vol.3253, pp.199-214
DOI : 10.1007/978-3-540-30206-3_15

M. Leuschel and M. J. Butler, ProB: A Model Checker for B, Lecture Notes in Computer Science, vol.2805, pp.855-874, 2003.
DOI : 10.1007/978-3-540-45236-2_46

M. Stoelinga, Fun with FireWire: Experiments with verifying the ieee1394 root contention protocol, Formal Aspects of Computing, 2002.

T. Westerlund and J. Plosila, Time Aware System Refinement, Electronic Notes in Theoretical Computer Science, vol.187, pp.91-106, 2007.
DOI : 10.1016/j.entcs.2006.08.046
URL : http://doi.org/10.1016/j.entcs.2006.08.046