scientific article; zbMATH DE number 1314563
Logic in computer science (03B70) Basic properties of first-order languages and structures (03C07) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
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.
- Self-stabilizing timestamps
- Concurrency model for distributed systems
- Proper protocol
- Event-based proof of the mutual exclusion property of Peterson's algorithm
- Studying Operational Models of Relaxed Concurrency
- scientific article; zbMATH DE number 4145305 (Why is no real title available?)
- scientific article; zbMATH DE number 3913662 (Why is no real title available?)
- Towards the unification of models for concurrency
- On the faithfulness of formal models
- Models for concurrency
- scientific article; zbMATH DE number 1283472 (Why is no real title available?)
- Modeling concurrency with interval traces
- Simplicial Models for Concurrency
- Modelling concurrent interactions
- Logical classification of distributed algorithms (Bakery algorithms as an example)
- Model-based design of concurrent programs
- Self-stabilizing \(\ell\)-exclusion
- Models of central capacity and concurrency
- Modelling concurrent interactions
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)