Holzmann, G.J., "Design and Validation of Protocols: A Tutorial", Computer Networks and ISDN Systems, Vol. 25, pp. 981-1017, 1993.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....protocols being combined to determine whether any new transitions must be added to the multiphase protocol to ensure that it is safe. Any new transitions generated are added to the finite automata of the component protocols from which a PROMELA model is constructed. PROMELA [Holzmann, 1991] [Holzmann, 1993] is a notation for specifying and formalizing the behaviour of finite automata. The PROMELA model is then verified using SPIN [Holzmann, 1991] Holzmann, 1993] a software tool for executing and simulating PROMELA specifications, and PAN [Holzmann, 1991] Holzmann, 1993] a software tool which ....

....generated are added to the finite automata of the component protocols from which a PROMELA model is constructed. PROMELA [Holzmann, 1991] Holzmann, 1993] is a notation for specifying and formalizing the behaviour of finite automata. The PROMELA model is then verified using SPIN [Holzmann, 1991] [Holzmann, 1993], a software tool for executing and simulating PROMELA specifications, and PAN [Holzmann, 1991] Holzmann, 1993] a software tool which uses reachability analysis techniques to check for logical inconsistencies in the state space of a PROMELA model. The remainder of this paper is organized as ....

[Article contains additional citation context not shown here]

Holzmann, G.J., "Design and Validation of Protocols: A Tutorial", Computer Networks and ISDN Systems, Vol. 25, pp. 981-1017, 1993.

....very important for obtaining a satisfactory specification from which a well behaved implementation was derived easily in a few days. Keywords application, process control, refinement approach, LTL properties verification, process equivalence, concurrent programming. Introduction Though SPIN[1 2 3] was specially designed for tackling protocols, it appeared that it was also quite suitable for addressing other problems such as distributed algorithms and multiprocessor operating systems [4] Provided one is able to express problems as protocols it is quite possible to take advantage of SPIN s ....

Holzmann G.J., Design and validation of protocols : a tutorial, Computer Networks, 25(9), April 93, pp. 981-1017.

....but usually require manual proofs. Stateoriented techniques such as reachability analysis or model checking may rely on automated tools. State explosion is always an issue, but we found a tool that addressed this problem. We decided to use PROMELA as a specification language, and to use SPIN[14 15] tool to check the large state spaces for different kinds of properties. PROMELA s expressive power is rather low, since it provides only a few basic data types and only very primitive type constructors, but it offers the possibility for expressing safety, liveness or precedence properties by ....

Holzmann G.J., Design and validation of protocols : a tutorial, Computer Networks, 25(9), April 93, pp. 981-1017.

....or at the end of a search. Dynamic Huffman coding or Lempel Zvi Welch compression techniques are therefore not directly usable in this type of application. Static Huffman encoding, and run length coding do have the required properties. Their effectiveness in model checkers was studied in [39]. It was found that run length encoding added a substantial runtime overhead ( 400 percent) in return for only a modest reduction of the memory requirements (10 to 20 percent) Static Huffman encoding was found to add a smaller, but still substantial run time overhead ( 300 percent) in return for ....

G.J. Holzmann, "Design and Validation of Protocols: A Tutorial," Computer Networks and ISDN Systems, vol. 25, no. 9, pp. 981-1,017, 1993.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC