1.

Record Nr.

UNISA996465868103316

Titolo

Logics for Concurrency [[electronic resource] ] : Structure versus Automata / / edited by Faron Moller, Graham Birtwistle

Pubbl/distr/stampa

Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1996

ISBN

3-540-49675-0

Edizione

[1st ed. 1996.]

Descrizione fisica

1 online resource (XIII, 268 p.)

Collana

Lecture Notes in Computer Science, , 0302-9743 ; ; 1043

Disciplina

004/.36/015113

Soggetti

Architecture, Computer

Computers

Computer logic

Mathematical logic

Algorithms

Computer System Implementation

Theory of Computation

Logics and Meanings of Programs

Mathematical Logic and Formal Languages

Computation by Abstract Devices

Algorithm Analysis and Problem Complexity

Lingua di pubblicazione

Inglese

Formato

Materiale a stampa

Livello bibliografico

Monografia

Note generali

Bibliographic Level Mode of Issuance: Monograph

Nota di contenuto

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.

Sommario/riassunto

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.