The Tree Identify Protocol of IEEE 1394 in μCRL

Abstract

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.

Introduction to Process Algebra

“…This section presents a brief overview of standard techniques that are used in these verifications. For verifications in the specification language µCRL [114] that use one or more of these techniques, see [56,98,111,140,186] Expansion. A basic technique in protocol verification is expansion [47] of the merge operator.…”

A case study in abstraction using E-LOTOS and the FireWire

“…Two other formal methods have been used to describe this protocol: I/O automata [4,17] and lCRL [18]. In the (untimed) I/O automata paper [4], the behaviour of the network as a whole is described in terms of predicates over a graph.…”

“…In the lCRL paper [18] there are three descriptions, corresponding to Spec, SynchImp and AsynchImp in terms of level of abstraction. Unlike the I/O automata version, nodes in the network are speci®ed individually.…”

The parallel composition of uniform processes with data

“…Many case studies have shown that for the analysis and verification of JLCRL processes, the so-called linear format is an adequate basis for verifications. We already have a long record of verifications based on linear process descriptions, see for example [5,6,8,11,19]. For this reason, our MCRL tool set [17] is particularly tailored for the analysis of linear process descriptions.…”