Logics for Concurrency: Structure versus Automata

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

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.

Author(s): Faron Moller, Graham Birtwistle (eds.)
Series: Lecture Notes in Computer Science 1043
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 1996

Language: English
Pages: 268
Tags: Logics and Meanings of Programs; Mathematical Logic and Formal Languages; Computation by Abstract Devices; Algorithm Analysis and Problem Complexity; Mathematical Logic and Foundations

Introduction....Pages 1-4
Specification Structures and propositions-as-types for concurrency....Pages 5-40
Automated temporal reasoning about reactive systems....Pages 41-101
Decidability results in automata and process theory....Pages 102-148
Modal and temporal logics for processes....Pages 149-237
An automata-theoretic approach to linear temporal logic....Pages 238-266