|Appears in Collections:||Computing Science and Mathematics Journal Articles|
|Peer Review Status:||Refereed|
|Title:||But what if I don't want to wait forever?|
|Citation:||Fidge C & Shankland C (2003) But what if I don't want to wait forever?, Formal Aspects of Computing, 14 (3), pp. 281-294.|
|Abstract:||We present an abstract model of the leader election protocol used in the IEEE 1394 High Performance Serial Bus standard. The model is expressed in the probabilistic Guarded Command Language. By formal reasoning based on this description, we establish the probability of the root contention part of the protocol successfully terminating in terms of the number of attempts to do so. Some simple calculations then allow us to establish an upper bound on the time taken for those attempts.|
|Rights:||Publisher policy allows this work to be made available in this repository; Published in Formal Aspects of Computing, April 2003, Volume 14, Issue 3, pp 281-294, by Springer. DOI: 10.1007/s001650300006 The original publication is available at www.springerlink.com|
This item is protected by original copyright
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
If you believe that any material held in STORRE infringes copyright, please contact firstname.lastname@example.org providing details and we will remove the Work from public display in STORRE and investigate your claim.