G. J. Holzmann, "Protocol Design: Redefining the State of the Art," IEEE Software #1992#.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and Pawel Gburzynski Department of Computing Science University of Alberta Edmonton, Alberta, Canada T6G 2H1 Abstract We present a system, descending from an eventdriven simulator, for verifying probabilistic and timed properties of communication protocols. Our system was inspired by Spin [5, 6, 7], and employs essentially the same efficient technique of state exploration, but it extends those ideas in the direction of expressing properties involving probabilities and strict timing (as opposed to the mere succession of events) This way, our approach is applicable to protocols in which the ....

.... To realistically capture the properties of a protocol, it is necessary to be able to specify its timing aspects (e.g. delays between events) and its probabilistic aspects (e.g. probability of loss) Note that the most widely e mail: ftheodore,pawelg cs.ualberta.ca known validation tool, Spin [6, 7], supports neither time nor probabilities. ffl Unlike most DES tools (Opnet, Smurph [3] that are based on common programming languages, like C or C , validation tools often employ special purpose languages (e.g. Promela in Spin, Kronos [2] The use of these languages is rooted in the desire ....

G. J. Holzmann. Protocol design: Redefining the state of the art. IEEE Software, pages 17--22, 1992.

....However, no implementation is described. In this paper we describe an on the fly validation system for CTL based on a different approach. Validation models are expressed in a CSP based language called ESML, and CTL is used to state correctness properties to be validated. State space caching[7, 8, 5] is used to detect revisited states. This helps to avoid redoing redundant work. The validation algorithm uses a technique called subproblem detection to handle nested temporal subformulae. This technique reduces the memory requirements of the state cache without increasing the run time ....

....until a message of the specified type is sent. The following examples should give the reader an idea of the data structuring facilities provided by ESML: TYPE Number = 0. 4; TYPE Mapping = ARRAY[10] OF Number; TYPE ProcessRecord = ProcessNumber, Priority: Number) TYPE ProcessQueue = LIST[8] OF ProcessRecord; max length = 8 ) The operators : HD , TL and LEN are available. The operation : is used to catenate a single new value to either end of a list. HD returns the first element of a list while TL returns the list with its first element removed. LEN returns the ....

[Article contains additional citation context not shown here]

G.J. Holzmann. Protocol Design: Redefining the State of the Art. IEEE Software, 9(1):17--22, January 1992.

....do RPCs for maximum parallelism 2. Synchronization among multiple threads thus created. Consequently, to correctly design a distributed application based on client server communications is not an easy task. Design errors such as deadlock and race conditions are as prevalent as in protocol design [1] ; they just migrate from inter process communications to intraprocess communications. Furthermore, debugging at the code level could be very difficult because of the following problems: the interference of the debugger with the code which can make it impossible to detect the effects of race ....

G. J. Holzmann. Protocol Design: Redefining the State of Art. IEEE Software Magazine, pp.17-22, January 1992.

....maximum parallelism 2. Synchronization among multiple threads thus created Consequently, to correctly design a distributed application based on client server communications is not an easy task. Design errors such as deadlock and race condition are as prevalent in it as those in protocol design [1] ; they just migrate from inter process communications to intra process communications. Furthermore, debugging at the code level provides little help as quoted from [2] Distributed debugging [of these communications] is considered extremely difficult because the interference of the debugger ....

G. J. Holzmann. Protocol Design: Redefining the State of Art. IEEE Software Magazine, pp.17-22, January 1992.

....are to prove correctness of generic distributed algorithms, such as the leader election algorithm illustrated in Fig. 1, nonstan3. The Spin model checker software can be retrieved by anonymous ftp from directory netlib s;in on host netlib.bell labs.com. dard mutual exclusion algorithms [37], communications network design problems [65] or protocol design problems [2] 3] 22] 23] 7] 16] 36] 51] In the course of the work on SPIN, we have also constructed verification models for, e.g. the Cambridge ring protocol [56] and the IEEE logical link control protocol LLC 802.2 ....

G.J. Holzmann, "Protocol Design: Redefining The State of the Art," IEEE Software, pp. 17-22, Jan. 1992.

No context found.

G. J. Holzmann, "Protocol Design: Redefining the State of the Art," IEEE Software #1992#.

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