Skip to main content
SpringerLink
Log in

Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol

  • Original Paper
  • Published:
Formal Aspects of Computing

Abstract.

The IEEE 1394 Root Contention Protocol is an industrial leader election algorithm for two processes in which probability, real time and parameters play an important role. This protocol has been analysed in various case studies, using a variety of verification and analysis methods. In this paper, we survey and compare several of these case studies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Engineering, University of California at Santa Cruz, California, USA, , , , , , US

    Mariëlle Stoelinga

Authors
  1. Mariëlle Stoelinga
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received September 2001/Accepted in revised form September 2001

Correspondence and offprint requests to: Mariëlle Stoelinga, Department of Computer Engineering, University of California at Santa Cruz, CA 95064, USA. Email: marielle@cse.ucsc.edu

Rights and permissions

Reprints and permissions

About this article

Cite this article

Stoelinga, M. Fun with FireWire: A Comparative Study of Formal Verification Methods Applied to the IEEE 1394 Root Contention Protocol. Form Aspects Comput 14, 328–337 (2003). https://doi.org/10.1007/s001650300009

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001650300009

Search

Navigation