Results 1  10
of
20
Verification of a leader election protocol  formal methods applied to IEEE 1394
 IEEE 1394. Formal Methods in System Design
, 1997
"... The IEEE 1394 high performance serial multimedia bus protocol allows several components to communicate with each other at high speed. In this paper we present a formal model and verification of a leader election algorithm that forms the core of the tree identify phase of the physical layer of the 13 ..."
Abstract

Cited by 28 (7 self)
 Add to MetaCart
The IEEE 1394 high performance serial multimedia bus protocol allows several components to communicate with each other at high speed. In this paper we present a formal model and verification of a leader election algorithm that forms the core of the tree identify phase of the physical layer of the 1394 protocol. We describe the algorithm formally in the I/O automata model of Lynch and Tuttle, and verify that for an arbitrary tree topology exactly one leader is elected. A large part of our verification has been checked mechanically with PVS, a verification system for higherorder logic.
A timed verification of the IEEE 1394 leader election protocol
 FORMAL METHODS IN SYSTEM DESIGN
, 2001
"... ..."
Parameterized Reachability Analysis of the IEEE 1394 Root Contention Protocol using TReX
 PROCEEDINGS OF THE WORKSHOP ON REALTIME TOOLS (RTTOOLS'2001)
, 2001
"... We report about the reachability analysis of fully parametrized models of the IEEE 1394 root contention protocol. This protocol uses timing constraints in order to elect a leader. The interesting point is that the timing constraints involve some parameters (transmission delay, bounds of waiting i ..."
Abstract

Cited by 14 (0 self)
 Add to MetaCart
We report about the reachability analysis of fully parametrized models of the IEEE 1394 root contention protocol. This protocol uses timing constraints in order to elect a leader. The interesting point is that the timing constraints involve some parameters (transmission delay, bounds of waiting intervals), and the behavior of the protocol strongly depends on the relation between these parameters. In order to synthesize the relation ensuring the correct behavior of the protocol, we apply the symbolic reachability techniques implemented in the TReX tool. We take the unparameterized model of Root Contention protocol proposed in [24] and study different parametrized versions of this model. We are able to synthesize automatically all the relations already found by proof or experiments on the unparameterized versions. We compare our results with those reported or obtained using other tools for parametrized systems.
The Parallel Composition of Uniform Processes with Data
 Theoretical Computer Science
, 2001
"... A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n; dt) = P (0; get(0; dt))/ eq(n; 0) .(P (n; get(n; dt)) k S(n \Gamma 1; dt)). In this formula eq(n; 0) is an equality test, and get(n; dt) denotes the nth data element in table dt . We deri ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
A general basis for the definition of a finite but unbounded number of parallel processes is the equation S(n; dt) = P (0; get(0; dt))/ eq(n; 0) .(P (n; get(n; dt)) k S(n \Gamma 1; dt)). In this formula eq(n; 0) is an equality test, and get(n; dt) denotes the nth data element in table dt . We derive a linear process equation with the same behaviour as S(n; dt ), and show that this equation is welldefined, provided one adopts the principle CLRSP from [4]. In order to demonstrate the strength of our result, we use it for the analysis of a standard example. We show that n + 1 concatenated buffers form a queue of capacity n + 1. 1 Introduction Distributed algorithms are often configured as an arbitrarily large but finite set of processors that run a similar program. Using the formalism CRL (micro Common Representation Language [9]) this can be described, using recursion and operators for parallelism. Several benchmark verifications in CRL and process algebra are therefore based on the...
Cones and Foci for Protocol Verification Revisited
 In Proc. 6th Conference on Foundations of Software Science and Computation Structures, LNCS 2620
, 2003
"... Abstract. We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
Abstract. We define a cones and foci proof method, which rephrases the question whether two system specifications are branching bisimilar in terms of proof obligations on relations between data objects. Compared to the original cones and foci method from Groote and Springintveld [22], our method is more generally applicable, and does not require a preprocessing step to eliminate τloops. We prove soundness of our approach and give an application. 1
The cones and foci proof technique for timed transition systems
 Information Processing Letters
"... ..."
Simplifying ItaiRodeh Leader Election for Anonymous Rings
, 2004
"... We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [20]. In contrast to the ItaiRodeh algorithm, our algorithms are finitestate. So they can be analyzed using explicit state space exploration ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We present two probabilistic leader election algorithms for anonymous unidirectional rings with FIFO channels, based on an algorithm from Itai and Rodeh [20]. In contrast to the ItaiRodeh algorithm, our algorithms are finitestate. So they can be analyzed using explicit state space exploration
A survey of formal methods applied to leader election
 in IEEE 1394. Journal of Universal Computer Science
, 2000
"... Abstract: We present a survey of formal speci cation techniques applied to the Tree Identify Protocol of the IEEE 1394 High Performance Serial Bus 1. Speci cations written in a variety of formalisms are compared with regard to a number of criteria including expressiveness, readability, standardisati ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract: We present a survey of formal speci cation techniques applied to the Tree Identify Protocol of the IEEE 1394 High Performance Serial Bus 1. Speci cations written in a variety of formalisms are compared with regard to a number of criteria including expressiveness, readability, standardisation, and level of analysis.