Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency

Jacobus W. De Bakker

ISBN 10: 354051080X / ISBN 13: 9783540510802

Published by Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 1989, 1989

About this Item

This item is printed on demand - it takes 3-4 days longer - Neuware -This volume is based on the 'School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency' organized by the editors and held in the period May 30-June 3, 1988 at Noordwijkerhout, The Netherlands. The School/Workshop was an activity of the project REX - Research and Education in Concurrent Systems. The volume contains tutorials and research contributions to the three approaches - linear time, - branching time, and - partial order in semantics and proof theory of concurrent programs by the main specialists in this field. It promotes an in-depth understanding of the relative merits and disadvantages of these three approaches. An introduction to the recent literature on the subject is provided by the invited research contributions. 728 pp. Englisch.

Seller Inventory # 9783540510802

Bibliographic Details

• Title: Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
• Publisher: Springer Berlin Heidelberg, Springer Berlin Heidelberg Mär 1989
• Publication Date: 1989
• Language: English
• ISBN 10: 354051080X
• ISBN 13: 9783540510802
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 235W x 155H x 39D millimeters 235 millimeters width by 155 millimeters height by 39 millimeters depth
• Weight: 1083 grams

About this title

Synopsis

This volume is based on the "School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency" organized by the editors and held in the period May 30-June 3, 1988 at Noordwijkerhout, The Netherlands. The School/Workshop was an activity of the project REX - Research and Education in Concurrent Systems. The volume contains tutorials and research contributions to the three approaches - linear time, - branching time, and - partial order in semantics and proof theory of concurrent programs by the main specialists in this field. It promotes an in-depth understanding of the relative merits and disadvantages of these three approaches. An introduction to the recent literature on the subject is provided by the invited research contributions.