DocumentCode
1360979
Title
A relational notation for state transition systems
Author
Lam, Simons S. ; Shankar, A. Udaya
Author_Institution
Dept. of Comput. Sci., Texas Univ., Austin, TX, USA
Volume
16
Issue
7
fYear
1990
fDate
7/1/1990 12:00:00 AM
Firstpage
755
Lastpage
775
Abstract
A relational notation for specifying state transition systems is presented. Several refinement relations between specifications are defined. To illustrate the concepts and methods, three specifications of the alternating-bit protocol are given. The theory is applied to explain auxiliary variables. Other applications of the theory to protocol verification, composition, and conversion are discussed. The approach is compared with previously published approaches
Keywords
formal specification; protocols; alternating-bit protocol; composition; refinement relations; relational notation; specifying state transition systems; Computer languages; Computer science; Equations; Helium; History; Logic programming; Petri nets; Probability; Protocols; Space vehicles;
fLanguage
English
Journal_Title
Software Engineering, IEEE Transactions on
Publisher
ieee
ISSN
0098-5589
Type
jour
DOI
10.1109/32.56101
Filename
56101
Link To Document