Amazon cover image
Image from Amazon.com

Logics for concurrency : structure versus automata / Faron Moller, Graham Birtwistle.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 1043.Publication details: Berlin ; New York : Springer, ©1996.Description: 1 online resource (xi, 266 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540496755
  • 3540496750
  • 3540609156
  • 9783540609155
Subject(s): Additional physical formats: Print version:: No titleDDC classification:
  • 004/.36/015113 20
LOC classification:
  • QA76.9.D5 M645 1996
Online resources:
Contents:
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.
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

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.

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.

English.

Powered by Koha