Mechanical verification of the IEEE 1394a root contention protocol using Uppaal2k

  • David P.L. Simons
  • Mariëlle I.A. Stoelinga
Special section on the practical use of high-level Petri nets


This paper reports on the mechanical verification of the IEEE 1394 root contention protocol. This is an industrial leader election protocol, in which timing parameters play an essential role. A manual verification of this protocol using I/O automata has been published in [24]. We improve the communication model presented in that paper. Using the Uppaal2k tool, we investigate the timing constraints on the parameters which are necessary and sufficient for correct protocol operation: by analyzing large numbers of protocol instances with different parameter values, we derive the required timing constraints. We explore the use of model checking in combination with stepwise abstraction. That is, we show that the implementation automaton correctly implements the specification via several intermediate automata, using Uppaal to prove the trace inclusion in each step.

Key words: Model checking – Leader election algorithms – Timed automata – IEEE 1394 – Communication protocol 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 2001

Authors and Affiliations

  • David P.L. Simons
    • 1
  • Mariëlle I.A. Stoelinga
    • 2
  1. 1.Philips Research Laboratories Eindhoven, Prof. Holstlaan 4, 5656 AA Eindhoven, The Netherlands; E-mail: david.simons@philips.comNL
  2. 2.Computing Science Institute, University of Nijmegen, P.O. Box 9010, 6500 GL Nijmegen, The Netherlands; E-mail: marielle@cs.kun.nlNL

Personalised recommendations