[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
research-article
Open access

The Tree Identify Protocol of IEEE 1394 in μCRL

Published: 01 May 1998 Publication History

Abstract.

We specify the tree identify protocol of the IEEE 1394 high performance serial multimedia bus at three different levels of detail using μCRL. We use the cones and foci verification technique of Groote and Springintveld to show that the descriptions are equivalent under branching bisimulation, thereby demonstrating that the protocol behaves as expected.

Cited By

View all
  • (2024)Four Formal Models of IEEE 1394 Link LayerElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.399.5399(21-100)Online publication date: 27-Mar-2024
  • (2023)Verification of the Busy-Forbidden ProtocolFundamentals of Software Engineering10.1007/978-3-031-42441-0_10(126-141)Online publication date: 4-May-2023
  • (2007)Analysis and verification of an automatic document feederProceedings of the 2007 ACM symposium on Applied computing10.1145/1244002.1244324(1499-1505)Online publication date: 11-Mar-2007
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Formal Aspects of Computing
Formal Aspects of Computing  Volume 10, Issue 5
May 1998
141 pages
ISSN:0934-5043
EISSN:1433-299X
Issue’s Table of Contents

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 01 May 1998
Published in FAC Volume 10, Issue 5

Author Tag

  1. Keywords: Process algebra; Verification of distributed systems; Leader election protocols

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)35
  • Downloads (Last 6 weeks)8
Reflects downloads up to 07 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Four Formal Models of IEEE 1394 Link LayerElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.399.5399(21-100)Online publication date: 27-Mar-2024
  • (2023)Verification of the Busy-Forbidden ProtocolFundamentals of Software Engineering10.1007/978-3-031-42441-0_10(126-141)Online publication date: 4-May-2023
  • (2007)Analysis and verification of an automatic document feederProceedings of the 2007 ACM symposium on Applied computing10.1145/1244002.1244324(1499-1505)Online publication date: 11-Mar-2007
  • (2006)Cones and fociFormal Methods in System Design10.1007/s10703-006-0004-329:1(1-31)Online publication date: 1-Jul-2006
  • (2005)A State Space Distribution Policy Based on Abstract InterpretationElectronic Notes in Theoretical Computer Science10.1016/j.entcs.2004.10.017128:3(35-45)Online publication date: Apr-2005
  • (2005)A distributed algorithm for strong bisimulation reduction of state spacesInternational Journal on Software Tools for Technology Transfer10.1007/s10009-004-0159-47:1(74-86)Online publication date: 25-Jan-2005
  • (2003)On the expressiveness of choice quantificationAnnals of Pure and Applied Logic10.1016/S0168-0072(02)00082-9121:1(39-87)Online publication date: May-2003
  • (2003)False Loop Detection in the IEEE 1394 Tree Identify PhaseFormal Aspects of Computing10.1007/s00165030000814:3(319-327)Online publication date: Apr-2003
  • (2003)IEEE 1394 Tree Identify Protocol: Introduction to the Case StudyFormal Aspects of Computing10.1007/s00165030000114:3(200-214)Online publication date: Apr-2003
  • (2003)Cones and Foci for Protocol Verification RevisitedFoundations of Software Science and Computation Structures10.1007/3-540-36576-1_17(267-281)Online publication date: 28-Feb-2003
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media