Logics for Concurrency

Structure versus Automata
1996
ISBN: 978-3-540-60915-5
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1043, 268 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 432 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Birtwistle, Graham

Moller, Faron

Fachgebiete

• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Funktionale, Logische, Parallele und Visuelle Programmierung
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker

Inhaltsverzeichnis

Specification Structures and propositions-as-types for concurrency.- Automated temporal reasoning about reactive systems.- Decidability results in automata and process theory.- Modal and temporal logics for processes.- An automata-theoretic approach to linear temporal logic.