Programming Languages

Download Algebraic Specification of Communication Protocols by S. Mauw, G. J. Veltink PDF

By S. Mauw, G. J. Veltink

Glossy machine networks now circle the area, however the transmission of knowledge between them will depend on the numerous varied protocols that outline the habit of the sender and receiver. it really is transparent as a result, that the actual description of those protocols is critical if harmonious verbal exchange is to be maintained. during this ebook the authors use the formal specification language PSF to supply an unambiguous description of a number of verbal exchange protocols of various degrees of complexity, starting from the alternating bit protocol to the token ring protocol. rookies, in addition to pros within the box of communique protocols, will reap the benefits of either the equipment of specification defined, and the protocols mentioned during this ebook.

Show description

Read Online or Download Algebraic Specification of Communication Protocols PDF

Best programming languages books

Algorithms + Data Structures = Programs (Prentice-Hall Series in Automatic Computation)

This can be a vintage ebook approximately easy algorithms and knowledge buildings. it is a should have e-book for figuring out behind-the-scenes common sense of normal libraries in sleek programming languages. will be on each programmer's learn record.

Conditional and Preferential Logics: Proof Methods and Theorem Proving

This quantity encompasses a revised and up to date model of the authors Ph. D. dissertation and is concentrated on facts equipment and theorem proving for conditional and preferential logics. Conditional logics are extensions of classical good judgment via a conditional operator, often denoted as =>. Conditional logics have a protracted historical past and lately they've got came upon program in numerous components of AI, together with trust revision and replace, the illustration of causal inferences in motion making plans and the formalization of hypothetical queries in deductive databases.

Geschichte der Nachrichtentechnik: Band 2 Nachrichtentechnische Entwicklungen in der ersten Hälfte des 19. Jahrhunderts

Die Geschichte der Nachrichtentechnik, dargestellt in Band 1 von den Anfängen im Altertum bis zum Ende des 18. Jahrhunderts, wird hiermit fortgeführt und behandelt die stürmische Entwicklung, in der mit dem Galvanismus und dem Elektromagnetismus die wesentlichen Grundlagen für die "elektrische Nachrichtentechnik" gelegt wurden.

Program construction : calculating implementations from specifications

Special approach tackles what such a lot books don't-why maths and common sense are primary instruments for a programmerThis complete consultant is a balanced mixture of mathematical thought and the perform of programmingStraightforward presentation of building ideas inlcuding: project axiom, sequential composition, case research, use of invariants and sure functionsIncludes a variety of pleasing and not easy examples and routines

Additional resources for Algebraic Specification of Communication Protocols

Example text

This is particularly so for specifications of large and complex systems. The result of most errors is that the initial algebra of the specification at hand does not comply with the model we have in mind. Tracking down the errors in the specification is facilitated by the use of a tool that generates the initial algebras of the sorts defined in a given specification of data types. This tool only works correctly for a restricted class of specifications, the class of complete term rewriting systems.

The Sender process is a good candidate for parameterization, because in essence it is capable of sending all kinds of objects. Therefore, we can make the data type a parameter of the module. process module begin Sender parameters Sender-Parameter begin sorts DATA end S e n d e r - P a r a m e t e r exports begin atoms i n p u t : DATA o u t p u t : DATA processes Sender end definitions Sender = sum(d i n DATA, input(d) . output(d)) . Sender end Sender In the example above we can see that parameters are introduced in the parameters section.

As we have explained in the previous section, these systems can become quite large, even for specifications of moderate size. Furthermore, the input for fully automated equivalence testers is restricted to the class of specifications that can be represented by a finite transition system. The equivalence tester in the PSF-Toolkit is based on a notion of equality induced by the so-called branching bisimulation semantics. The explanation of the notion of bisimulation is beyond the scope of this book, but there exist numerous articles on this subject in the literature, to which we refer for detailed information.

Download PDF sample

Rated 4.39 of 5 – based on 22 votes