Summary and Info
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.
More About the Author
Faron George Moller (born February 25, 1962 in Trail, British Columbia) is a Canadian-born British computer scientist and expert on theoretical computer science, particularly infinite-state automata theory and temporal logic.
Review and Comments
Rate the Book
Logics for Concurrency: Structure versus Automata 0 out of 5 stars based on 0 ratings.