Topology in Process Calculus

Mingsheng Ying

ISBN 10: 0387950923 / ISBN 13: 9780387950921

Published by Springer New York, Humana Mär 2001, 2001

About this Item

This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 232 pp. Englisch.

Seller Inventory # 9780387950921

Bibliographic Details

• Title: Topology in Process Calculus
• Publisher: Springer New York, Humana Mär 2001
• Publication Date: 2001
• Language: English
• ISBN 10: 0387950923
• ISBN 13: 9780387950921
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 18D millimeters 241 millimeters width by 160 millimeters height by 18 millimeters depth
• Weight: 518 grams

About this title

Synopsis

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.