Overview

Communication and concurrency are essential in understanding complex dynamic systems, and there have been many theories to deal with them such as Petri nets, CSP and ACP. Among them, CCS (process calculus is one of the most important and mathematically developed models of communication and concurrency. Various behavior equivalences between agents, such as (strong and weak) bisimilarity, observation congruence, trace equivalence, testing equivalence and failure equivalence, are central notions in process calculus. In the real applications of process calculus, specification and implementation are described as two agents, correctness of programs is treated as a certain behavior equivalence between specification and implementation, and then the proof of correctness of programs is a task to establish some behavior equivalence between them. The goal of this book is to provide some suitable and useful concepts and tools for the understanding and analysis of approximate correctness of programs in concurrent systems. Throughout this book the focus is on the framework of process calculus, and the main idea is to construct some natural and reasonable topological structures which can reveal suitably a mechanism of approximate computation in process calculus and to work out various relationships among processes which are compatible with these topological structures.

Full Product Details

Author:   Mingsheng Ying
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   Softcover reprint of the original 1st ed. 2001
Dimensions:   Width: 15.50cm , Height: 1.20cm , Length: 23.50cm
Weight:   0.361kg
ISBN:  

9781461265221

ISBN 10:   1461265223
Pages:   220
Publication Date:   28 October 2012
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand  
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1 Introduction.- 2 Process Calculus.- 2.1 Transition Systems.- 2.2 Hennessy-Mi lner Logic.- 2.3 Basic Language.- 2.4 Transitional Semantics.- 2.5 Strong Bisimulations.- 2.6 Bisimulations.- 3 Bisimulation and Trace Limits of Agents 37.- 3.1 Strong Bisimulat ion Limits.- 3.2 *-Strong Bisi mulation Limits.- 3.3 Bisimulati on Limits.- 3.4 Trace Limits.- 4 Limit Behavior of Agents.- 4.1 Modifications of Topologies on Actions.- 4.2 Topologies on Agents.- 4.3 Several Limit Theorems.- 5 Near Bisimulations Defined by Closures.- 5.1 Near Bisimulations in Transition Systems.- 5.2 Near Strong Bisimulations.- 5.3 Near (Weak) Bisimulations.- 6 Bisimulation Indexes Induced by Metrics on Actions.- 6.1 Bisimulation Indexes in Transition Systems.- 6.2 Hennessy-Milner Logical Characterization of Bisimulation Indexes.- 6.3 Strong Bisimulation Indexes.- 6.4 (Weak) Bisimulation Indexes.- 6.5 Approximate Communication.- 6.6 Some Applications: Two Examples in Timed CCS.- 6.7 Some Appli cations: An Example in Real Time ACP.- 7 Conclusion.- References.

Reviews

Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions