Algebraic specification of communication protocols by S. Mauw, G. J. Veltink

By S. Mauw, G. J. Veltink

Smooth computing device networks now circle the realm, however the transmission of knowledge between them will depend on the various diverse protocols that outline the habit of the sender and receiver. it's transparent as a result, that the exact description of those protocols is necessary if harmonious conversation is to be maintained. during this publication the authors use the formal specification language PSF to supply an unambiguous description of numerous conversation protocols of various degrees of complexity, starting from the alternating bit protocol to the token ring protocol. novices, in addition to pros within the box of conversation protocols, will take advantage of either the equipment of specification defined, and the protocols mentioned during this publication.

Show description

Read or Download Algebraic specification of communication protocols PDF

Best programming languages books

TCP/IP Analysis and Troubleshooting Toolkit

Vital consultant for troubleshooting and studying TCP/IP on the web and company networkFollows a pragmatic method of make sure that TCP/IP remains up and runningDescribes difficulties in response to real eventualities within the box and provides confirmed recommendations to house themExplains the way to use to be had instruments and utilities to their greatest advantageCompanion site contains samples situations and code from the booklet

Smalltalk-80: The Language and its Implementation

Desk OF CONTENTS: (1) items and Messages (2) Expression Syntax (3) sessions and circumstances (4) Subclasses (5) Metaclasses (6) Protocol for all items (7) Linear Measures (8) Numerical periods (9) Protocol for All assortment sessions (10) Hierarchy of the gathering periods (11) 3 Examples that Use Collections (12) Protocol for Streams (13) Implementation of the elemental assortment Protocol (14) Kernel aid (15) a number of autonomous strategies (16) Protocol sessions (17) The Programming Interface (18) pictures Kernel (19) Pens (20) show items (21) chance Distributions (22) Event-Driven Simulations (23) facts amassing in Event-Driven Simulations (24) using assets in Event-Driven Simulations (25) Coordinated assets for Event-Driven Simulations (26) The Implementation (27) Specification of the digital computer (28) Formal Specification of the Interpreter (29) Formal Specification of the Primitive tools (30) Formal Specification of the item reminiscence.

Nominal Sets: Names and Symmetry in Computer Science

Nominal units supply a promising new mathematical research of names in formal languages dependent upon symmetry, with many purposes to the syntax and semantics of programming language constructs that contain binding, or localising names. half I presents an creation to the fundamental concept of nominal units.

Agile ALM: Lightweight tools and Agile strategies

Agile ALM is a advisor for Java builders who are looking to combine versatile agile practices and light-weight tooling alongside all stages of the software program improvement strategy. The booklet introduces a brand new imaginative and prescient for coping with swap in standards and technique extra successfully and flexibly. It synthesizes technical and useful components to supply a complete method of software program improvement.

Extra info for Algebraic specification of communication protocols

Example text

A regular expression consisting of a single nonmetacharacter matches itself. Thus, a single letter or digit is a basic regular expression that matches itself. To preserve the literal meaning of a metacharacter in a regular expression, precede it by a backslash. Thus, the regular expression '$ matches the character $. If a character is preceded by a single '· we'll say that character is quoted. In a regular expression, an unquoted caret " matches the beginning of a string, an unquoted dollar-sign $ matches the end of a string, and an unquoted period • matches any single character.

For example, this program prints all input fields, one per line: i = 1 while (i <::: NF) print $i i++ The loop stops when i reaches NF+ 1, and that is its value after the loop exits. 2 for (expression 1 ; expression 2 ; 49 expression 3 ) statement Newlines are optional after the right parenthesis. The for statement has the same effect as expression 1 while (expression 2 ) statement expression 3 } so for (i = 1; i <= NF; i++) print $i does the same loop over the fields as the while example above.

2 for (expression 1 ; expression 2 ; 49 expression 3 ) statement Newlines are optional after the right parenthesis. The for statement has the same effect as expression 1 while (expression 2 ) statement expression 3 } so for (i = 1; i <= NF; i++) print $i does the same loop over the fields as the while example above. In the for statement, all three expressions are optional. If expression 2 is missing, the condition is taken to be always true, so for ( ; ; ) is an infinite loop. An alternate version of the for statement that loops over array subscripts is described in the section on arrays.

Download PDF sample

Rated 4.05 of 5 – based on 38 votes