 |
|
|
Item Details
| Title:
|
LOGICS FOR CONCURRENCY
STRUCTURE VERSUS AUTOMATA |
| By: |
Faron Moller (Editor), Graham M. Birtwistle (Editor) |
| Format: |
Paperback |
| List price:
|
£62.99 |
|
We currently do not stock this item, please contact the publisher directly for
further information.
|
|
|
|
|
|
| ISBN 10: |
3540609156 |
| ISBN 13: |
9783540609155 |
| Publisher: |
SPRINGER-VERLAG BERLIN AND HEIDELBERG GMBH & CO. KG |
| Pub. date: |
6 March, 1996 |
| Edition: |
1996 ed. |
| Series: |
Lecture Notes in Computer Science 1043 |
| Pages: |
268 |
| Description: |
In this work on 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 remaining chapter presents a category-theoretic approach to verification. |
| Synopsis: |
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. |
| Illustrations: |
XIII, 268 p. |
| Publication: |
Germany |
| Imprint: |
Springer-Verlag Berlin and Heidelberg GmbH & Co. K |
| Returns: |
Returnable |
|
|
|
 |
Ramadan and Eid al-Fitr
A celebratory, inclusive and educational exploration of Ramadan and Eid al-Fitr for both children that celebrate and children who want to understand and appreciate their peers who do.
|
|
|
|
|
|
|
|
|
|
|