M. Abadi and L. Lamport, An old-fashioned recipe for real time, ACM Transactions on Programming Languages and Systems, vol.16, issue.5, pp.1543-1571, 1994.
DOI : 10.1145/186025.186058

J. 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. Cansell and D. Méry, Foundations of the b method, Computers and Artificial Intelligence, vol.22, issue.3, pp.221-256, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00099794

D. Cansell, D. Méry, and J. Rehm, Time Constraint Patterns for Event B Development, 2007.
DOI : 10.1007/11955757_13
URL : https://hal.archives-ouvertes.fr/hal-00149163

M. Leuschel and M. J. Butler, ProB: A Model Checker for B, FME, Volume 2805 of Lecture Notes in Computer Science, 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.