Process Algebra with Timing
This book is concerned with a number of theories that can be used for describ­ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer­ based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The complexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and in­ teract on time as well adds considerably to the complexity. In developing such a system, it is important to be able to acquire a better understanding of the relevant issues at the conceptual level, to describe the system in a precise way at various levels of detail, and to analyze it on the basis of the descriptions. When the early algebraic theories about processes, such as ACP [16, 17, 20], CCS [49, 50] and CSP [27, 39], were developed for that purpose, the established opinion was still that timing is a concern that can more often than not be treated independently. It is therefore not surprising that timing is deliberately ignored in those theories. They have now all been extended to deal with timing.
1100015303
Process Algebra with Timing
This book is concerned with a number of theories that can be used for describ­ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer­ based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The complexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and in­ teract on time as well adds considerably to the complexity. In developing such a system, it is important to be able to acquire a better understanding of the relevant issues at the conceptual level, to describe the system in a precise way at various levels of detail, and to analyze it on the basis of the descriptions. When the early algebraic theories about processes, such as ACP [16, 17, 20], CCS [49, 50] and CSP [27, 39], were developed for that purpose, the established opinion was still that timing is a concern that can more often than not be treated independently. It is therefore not surprising that timing is deliberately ignored in those theories. They have now all been extended to deal with timing.
54.99 In Stock
Process Algebra with Timing

Process Algebra with Timing

Process Algebra with Timing

Process Algebra with Timing

Paperback(Softcover reprint of hardcover 1st ed. 2002)

$54.99 
  • SHIP THIS ITEM
    In stock. Ships in 1-2 days.
  • PICK UP IN STORE

    Your local store may have stock of this item.

Related collections and offers


Overview

This book is concerned with a number of theories that can be used for describ­ ing and analyzing systems of interacting components in case it is desirable or necessary to regard their time-dependent behavior. Society is becoming increasingly more dependent on complex computer­ based systems that are composed of several components that act concurrently and interact - to synchronize and communicate with each other. The complexity of these systems arises to a great extent from the many ways in which their components can interact. The need that these components act and in­ teract on time as well adds considerably to the complexity. In developing such a system, it is important to be able to acquire a better understanding of the relevant issues at the conceptual level, to describe the system in a precise way at various levels of detail, and to analyze it on the basis of the descriptions. When the early algebraic theories about processes, such as ACP [16, 17, 20], CCS [49, 50] and CSP [27, 39], were developed for that purpose, the established opinion was still that timing is a concern that can more often than not be treated independently. It is therefore not surprising that timing is deliberately ignored in those theories. They have now all been extended to deal with timing.

Product Details

ISBN-13: 9783642077883
Publisher: Springer Berlin Heidelberg
Publication date: 12/01/2010
Series: Monographs in Theoretical Computer Science. An EATCS Series
Edition description: Softcover reprint of hardcover 1st ed. 2002
Pages: 287
Product dimensions: 6.10(w) x 9.25(h) x 0.24(d)

Table of Contents

1. No Timing.- 2. Discrete Relative Timing.- 3. Discrete Absolute Timing.- 4. Continuous Relative Timing.- 5. Continuous Absolute Timing.- 6. Abstraction.- 7. Features.- A.1 Elimination.- A.2 Soundness.- A.3 Completeness.- B. Background Material.- B.1 Basic Equational Logic and SOS Theory.- B.1.1 Equational Logic.- B.1.2 SOS Theory.- B.2 Some Further Topics.- B.2.1 TSSs with Negative Premises.- B.2.2 Variable Binding Operators.- B.2.3 Conservativity and Completeness.- B.2.4 Generalizations.- B.2.5 Given Sorts and Parametrization.- B.3 Non-negative Real Numbers.- References.
From the B&N Reads Blog

Customer Reviews