Process Algebra ( Cambridge Tracts in Theoretical Computer Science )

Publication series ：Cambridge Tracts in Theoretical Computer Science

Author： J. C. M. Baeten; W. P. Weijland  

Publisher： Cambridge University Press‎

Publication year： 0000

E-ISBN: 9780511878473

Subject： TP312 程序语言、算法语言

Keyword： 程序语言、算法语言

Language： ENG

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Process Algebra

Description

This is an introduction to process algebra, also known as the Algebra of Communicating Processes (ACP). It is a self-contained mathematical approach to the theory which can be used for graduate courses, though it also has material of interest to researchers. It is a unique introduction to this model of concurrent programming and will be essential reading for all computer scientists interested in parallel processing and algebraic methods in computer science.

Chapter

Cover

Half-title

Title

Copyright

Contents

Preface

1. Preliminaries

1.1 Introduction

1.2 Terms and equations

1.3 Algebras

1.4 Term rewriting systems

2. Basic process algebra

2.1 The basic system

2.2 Deadlock and termination

2.3 Recursion

2.4 Projection and bounded non-determinism

2.5 The term model

2.6 Protective limit model

2.7 Process graphs

2.8 Regular processes

2.9 Stack

3. Concurrent processes

3.1 Interleaving

3.2 Some theorems on PA

3.3 Merge and termination

3.4 Models

3.5 Bag

3.6 Renaming

4. Communication

4.1 Communication function

4.2 ACP

4.3 Some theorems on ACP

4.4 Termination

4.5 Models

4.6 Examples

4.7 Alternating Bit Protocol (specification)

4.8 Queue

5. Abstraction

5.1 Abstraction and silent step

5.2 ACPτ

5.3 Termination

5.4 Models

5.5 Recursion

5.6 Divergence and fairness

5.7 Alternating Bit Protocol (Verification)

5.8 Observation equivalence

6. Features

6.1 Priorities and interrupts

6.2 Alphabets and conditional axioms

6.3 Localization, traces and restriction

6.4 State operator

6.5 Asynchronous communication

6.6 Asymmetric communication

6.7 Process creation

6.8 Synchronous cooperation

6.9 Signals and observation

7. Semantics

7.1 Bisimulation and trace semantics

7.2 Failure and ready semantics

7.3 Failure trace and ready trace semantics

8. Sources and related work

8.1 Historical remarks

8.2 CCS

8.3 CSP

Bibliography

Glossary

Index of names

Index of symbols and notation

The users who browse this book also browse