DocumentCode
746337
Title
Some Comments on "Transition-Oriented" Versus "Structured" Specification of Distributed Algorithms and Protocols
Author
Bochmann, G.V. ; Verjus, J.P.
Author_Institution
Department d´´IRO, University of Montreal
Issue
4
fYear
1987
fDate
4/1/1987 12:00:00 AM
Firstpage
501
Lastpage
505
Abstract
Formal description techniques (FDT\´s) are being developed for the specification of communication protocols and other distributed systems. Some of them (namely SDL and Estelle) are based on an extended state transition model and promote a "transition-oriented" specification style. Another one (namely Lotos) and most highlevel programming languages promote a style which is called "structured." The correspondence compares these two specification styles in the framework of rendezvous interactions between different system modules. The advantages of each of the two styles are discussed in relation with an example of a virtual ring mutual exclusion protocol. Transformation rules between the two approaches are given. An extension to the state transition oriented FDT\´s is also suggested in order to allow for a structured specification style.
Keywords
Distributed algorithms; Estelle; SDL; exception handling; extended state machines; mutual exclusion; structured programming; Automata; Carbon capture and storage; Computer languages; Distributed algorithms; ISO; LAN interconnection; Modems; Protocols; Signal generators; Specification languages; Distributed algorithms; Estelle; SDL; exception handling; extended state machines; mutual exclusion; structured programming;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/TSE.1987.233188
Filename
1702243
Link To Document