Advertisement

Root Contention in IEEE 1394

  • Mariëlle Stoelinga
  • Frits Vaandrager
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1601)

Abstract

The model of probabilistic I/O automata of Segala and Lynch is used for the formal specification and analysis of the root contention protocol from the physical layer of the IEEE 1394 (“FireWire”) standard. In our model of the protocol both randomization and real-time play an essential role. In order to make our verification easier to understand we introduce several intermediate automata in between the implementation and the specification automaton. This allows us to use very simple notions of refinement rather than the more general but also very complex simulation relations which have been proposed by Segala and Lynch.

Keywords

Probabilistic Choice Reachable State Root Contention Normed Simulation Probabilistic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253–284, 1991.MathSciNetCrossRefzbMATHGoogle Scholar
  2. [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.Google Scholar
  3. [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 T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science. Springer-Verlag, 1996 Alur et al. [2]}, pages 232–243.CrossRefGoogle Scholar
  4. [4]
    C. Daws, A. Olivero, S. Tripakis, and S. Yovine. The tool KRONOS. In T.A. Henzinger, and E.D. Sontag, editors. Hybrid Systems III, volume 1066 of Lecture Notes in Computer Science. Springer-Verlag, 1996 Alur et al. [2]}, pages 208–219.CrossRefGoogle Scholar
  5. [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.Google Scholar
  6. [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. [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.CrossRefGoogle Scholar
  8. [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.Google Scholar
  9. [9]
    IEEE Computer Society. IEEE Standard for a High Performance Serial Bus. Std 1394-1995, August 1996.Google Scholar
  10. [10]
    IEEE Computer Society. P1394a Draft Standard for a High Performance Serial Bus (Supplement). Draft 2.0, March 1998.Google Scholar
  11. [11]
    L. Kühne, 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.Google Scholar
  12. [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. [13]
    N.A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers, Inc., San Fransisco, California, 1996.zbMATHGoogle Scholar
  14. [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.Google Scholar
  15. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  16. [16]
    MindShare, Inc, and D. Anderson. FireWire System Architecture: IEEE 1394. Addison Wesley, 1998.Google Scholar
  17. [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.Google Scholar
  18. [18]
    R. Segala. Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology, June 1995. Available as Technical Report MIT/LCS/TR-676.Google Scholar
  19. [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.MathSciNetCrossRefzbMATHGoogle Scholar
  20. [20]
    R. Segala and N.A. Lynch. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing, 2(2):250–273, 1995.MathSciNetzbMATHGoogle Scholar
  21. [21]
    M.I.A. Stoelinga. Gambling for leadership: Root contention in IEEE 1394. Technical Report CSI-R9904, Computing Science Institute, University of Nijmegen, 1999.Google Scholar
  22. [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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Mariëlle Stoelinga
    • 1
  • Frits Vaandrager
    • 1
  1. 1.Computing Science InstituteUniversity of NijmegenNijmegenThe Netherlands

Personalised recommendations