Root contention in IEEE 1394

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1601, Issue , 1999, Pages 53-74

  Stoelinga, Mariëlle ^a   Vaandrager, Frits ^a  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; FORMAL SPECIFICATION; IEEE STANDARDS; NETWORK LAYERS;

COMPLEX SIMULATION; FIREWIRES; FORMAL SPECIFICATION AND ANALYSIS; IEEE-1394; PHYSICAL LAYERS; REAL TIME; ROOT CONTENTION PROTOCOLS;

REAL TIME SYSTEMS;

EID: 84957671111     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48778-6_4     Document Type: Conference Paper

References (22)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, 1991.
2. R. Alur, T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
3. J. Bengtsson, K.G. Larsen, F. Larsson, P. Pettersson, and Wang Yi. UPPAAL: a tool suite for the automatic verification of real-time systems. In Alur et al. [2], pages 232-243.
4. C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In Alur et al. [2], pages 208-219.
5. M.C.A. Devillers, W.O.D. Griffioen, J.M.T Romijn, and F.W. Vaandrager. Verification of a leader election protocol-formal methods applied to IEEE 1394. Technical Report CSI-R9728, Computing Science Institute, University of Nijmegen, December 1997. Submitted.
6. S.J. Garland, N.A. Lynch, and M. Vaziri. IOA: A language for specifiying, programming, and validating distributed systems, September 1997. Available through URL http://larch.lcs.mit.edu:8001/~garland/ioaLanguage.html.
7. W.O.D. Griffioen and F.W. Vaandrager. Normed simulations. In A.J. Hu and M.Y. Vardi, editors, Proceedings of the 8th International Conference on Computer Aided Verification, Vancouver, BC, Canada, volume 1427 of Lecture Notes in Computer Science, pages 332-344. Springer-Verlag, June/July 1998.
8. T.A. Henzinger and P.-H. Ho. HyTech: The Cornell HYbrid TECHnology Tool. In U.H. Engberg, K.G. Larsen, and A. Skou, editors, Proceedings of the Workshop on Tools and Algorithms for the Construction and Analysis of Systems, Aarhus, Denmark, volume NS-95-2 of BRICS Notes Series, pages 29-43. Department of Computer Science, University of Aarhus, May 1995.
9. IEEE Computer Society. IEEE Standard for a High Performance Serial Bus. Std 1394-1995, August 1996.
10. IEEE Computer Society. P1394a Draft Standard for a High Performance Serial Bus (Supplement). Draft 2.0, March 1998.
11. L. Kuhne, J. Hooman, and W.P. de Roever. Towards mechanical verification of parts of the IEEE P1394 serial bus. In I. Lovrek, editor, Proceedings of the 2nd International Workshop on Applied Formal Methods in System Design, Zagreb, pages 73-85, 1997.
12. S.P. Luttik. Description and formal specification of the Link layer of P1394. In I. Lovrek, editor, Proceedings of the 2nd International Workshop on Applied Formal Methods in System Design, Zagreb, pages 43-56, 1997. Also available as Report SEN-R9706, CWI, Amsterdam. See URL http://www.cwi.nl/~luttik/.
13. N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Fransisco, California, 1996.
14. N.A. Lynch, I. Saias, and R. Segala. Proving time bounds for randomized distributed algorithms. In Proceedings of the 13th Annual ACM Symposium on the Principles of Distributed Computing, pages 314-323, Los Angeles, CA, August 1994.
15. N.A. Lynch and F.W. Vaandrager. Forward and backward simulations, II: Timing-based systems. Information and Computation, 128(1):1-25, July 1996.
16. MindShare, Inc, and D. Anderson. FireWire System Architecture: IEEE 1394. Addison Wesley, 1998.
17. A. Pogosyants, R. Segala, and N.A. Lynch. Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study. In M. Mavronicolas and Ph. Tsigas, editors, Proceedings of 11th International Workshop on Distributed Algorithms (WDAG'97), Saarbrucken, Germany, September 1997, volume 1320 of Lecture Notes in Computer Science, pages 111-125. Springer-Verlag, 1997. Also, Technical Memo MIT/LCS/TM-555, Laboratory for Computer Science, Massachusetts Institute of Technology.
18. R. Segala. Modeling and Verification of Randomized Distributed Rea,l-Tim,e Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.
19. R. Segala, R. Gawlick, J.F. Søgaard-Andersen, and N.A. Lynch. Liveness in timed and untimed systems. Information and Computation, 141(2):119-171, March 1998.
20. R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250-273, 1995.
21. M.I.A. Stoelinga. Gambling for leadership: Root contention in IEEE 1394. Technical Report CSI-R9904, Computing Science Institute, University of Nijmegen, 1999.
22. M.I.A. Stoelinga and F.W. Vaandrager. Gambling together in Monte Carlo: Step refinements for probabilistic automata. Technical Report CSI-R99xx, Computing Science Institute, University of Nijmegen, 1999. To appear.