Skip to main content
  • Book
  • © 2001

Topology in Process Calculus

Approximate Correctness and Infinite Evolution of Concurrent Programs

Authors:

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (7 chapters)

  1. Front Matter

    Pages i-viii
  2. Introduction

    • Mingsheng Ying
    Pages 1-9
  3. Process Calculus

    • Mingsheng Ying
    Pages 11-36
  4. Bisimulation and Trace Limits of Agents

    • Mingsheng Ying
    Pages 37-94
  5. Limit Behavior of Agents

    • Mingsheng Ying
    Pages 95-111
  6. Near Bisimulations Defined by Closures

    • Mingsheng Ying
    Pages 113-138
  7. Conclusion

    • Mingsheng Ying
    Pages 207-211
  8. Back Matter

    Pages 213-220

About this book

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.

Authors and Affiliations

  • Department of Computer Science and Technology State Key Laboratory of Intelligent Technology, and Systems, Tsinghua University, Beijing, China

    Mingsheng Ying

Bibliographic Information

  • Book Title: Topology in Process Calculus

  • Book Subtitle: Approximate Correctness and Infinite Evolution of Concurrent Programs

  • Authors: Mingsheng Ying

  • DOI: https://doi.org/10.1007/978-1-4613-0123-3

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer Science+Business Media New York 2001

  • Hardcover ISBN: 978-0-387-95092-1Published: 30 March 2001

  • Softcover ISBN: 978-1-4612-6522-1Published: 28 October 2012

  • eBook ISBN: 978-1-4613-0123-3Published: 06 December 2012

  • Edition Number: 1

  • Number of Pages: VIII, 220

  • Topics: Software Engineering/Programming and Operating Systems

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 54.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access