This book presents five tutorial-style lectures on various approaches to the problem of verifying distributed systems: three chapters concentrate on linear-time or branching-time temporal logics; one addresses process equivalence with an emphasis on infinite-state systems; and the final one presents a novel category-theoretic approach to verification. The various formalisms for expressing properties of concurrent systems, based on automata-theoretic techniques or structural properties, are studied in detail.
Much attention is paid to the style of writing and complementary coverage of the relevant issues. Thus these lecture notes are ideally suited for advanced courses on logics for concurrent systems. Equally, they are indispensable reading for anyone researching the area of distributed computing.

We have all experienced delays and frustrations as a result of the notorious computer glitch. However, the more dependent we become on computational systems in our daily lives, the more we must ensure that they are safe, reliable and user-friendly.

This engaging textbook presents the fundamental mathematics and modelling techniques for computing systems in a novel and light-hearted way, which can be easily followed by students at the very beginning of their university education. Key concepts are taught through a large collection of challenging yet fun mathematical games and logical puzzles that require no prior knowledge about computers. The text begins with intuition and examples as a basis from which precise concepts are then developed; demonstrating how, by working within the confines of a precise structured method, the occurrence of errors in the system can be drastically reduced.

Topics and features: introduces important concepts from discrete mathematics as the basis of computational thinking, presented in a stimulating and motivating style; demonstrates how game theory provides a paradigm for an intuitive understanding of the nature of computation; contains more than 400 exercises throughout the text, with detailed solutions to half of these presented at the end of the book, together with numerous theorems, definitions and examples; describes an approach to the modelling of computing systems based on state transition systems, exploring the languages and techniques for expressing and reasoning about systems specifications and concurrent implementations.

This clearly written and classroom-tested textbook/reference is essential reading for first-year undergraduate modules on discrete mathematics and systems modelling."