scientific article; zbMATH DE number 1314563

From MaRDI portal
Publication:4256353





The book presents the application of models of first-order theory to the analysis of concurrent protocols. The author argues that behavioral reasoning (in opposition to assertional proof) can be formalized by first-order theory and practically used to prove the correctness of protocols. The first part introduces some elements of model theory, in particular the notions of structure, first-order language and satisfaction. These notions are used to model system executions of concurrent protocols. A simple language allowing to model and prove the correctness of concurrent protocols is introduced. Its semantics is given in terms of local states and system executions as first-order formulas. Several small illustrative examples are modeled and checked along this part. The notions introduced in the first part are used in the second and third parts on particular types of protocols. The second part deals with protocols with shared-variable communication. The consumer/producer problem and two solutions to the problem serve as examples. The third part discusses messages passing communication and the notions of channels, networks, causality, group communication.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4256353)