1. Bandini, G., Lutje Spelberg, R.L., de Rooij, R.C.H., Toetenel, W.J.: Application of parametric model checking - the root contention protocol. In: Sixth Annual Conference of the Advanced School for Computing and Imaging (ASCI 2000), Lommel, Belgium (June 2000)
2. Beauquier, D., Slissenko, A.: On semantics of algorithms with continuous time. Technical Report 97–15, Revised version., University Paris 12, Department of Informatics (1997), Available at http://www.eecs.umich.edu/gasm/ and at http://www.univparis12.fr/lacl/
3. Beauquier, D., Slissenko, A.: A first order logic for specification of timed algorithms: Basic properties and a decidable class. Annals of Pure and Applied Logic 113(1-3), 13–52 (2002)
4. Beauquier, D., Crolard T., Prokofieva E.: Automatic verification of real time systems: A case study. In: Third Workshop on Automated Verification of Critical Systems (AVoCS 2003), Technical Report of the University of Southampton, pp. 98–108, Southampton (UK) (April 2003)
5. Collomb-Annichini, A., Sighireanu, M.: Parametrized reachability analysis of the IEEE 1394 root contention protocol using TReX. In: Proceedings of the Workshop on Real-Time Tools, RT-TOOLS 2001 (2001)