Ab dem 31. Januar stellt buchhandel.de die Verkaufsfunktion ein!

Bitte sichern Sie alle notwendigen Daten, wie etwa Rechnungen oder Ihre Wunschliste in Ihrem Kundenprofil.
Weitere Informationen finden Sie hier: https://www.buchhandel.de/info/hilfe.
Suche ›

Topology in Process Calculus

Approximate Correctness and Infinite Evolution of Concurrent Programs

Springer New York,
101,64 € Lieferbar in 2-3 Tagen
Dieses Produkt ist auch verfügbar als:


Process calculi are among the most successful models of concurrent systems. Various behavior equivalences between processes are central notions in CCS (calculus of communicating systems) and other process calculi. In the real applications, specification and implementation are described as two processes, and correctness of programs is treated as a certain behavior equivalence between them.
The purpose of this book is to establish a theory of approximate correctness and infinite evolution of concurrent programs by employing some notions and tools from point-set topology. This book is restricted to CCS for simplicity, but the main idea also applies to some other process calculi. The concept of bisimulation limits, useful for the understanding and analysis of infinite evolution of processes, is introduced. In addition, the notions of near bisimulations and bisimulation indexes, suitable in describing approximate correctness of concurrent programs, are proposed.
The book will be of particular interest to researchers in the fields of theoretical computer science, especially theory of concurrency and hybrid systems, and graduate students in related disciplines. It will also be valuable to practical system designers developing concurrent and/or real-time systems.


Titel: Topology in Process Calculus
Autoren/Herausgeber: Mingsheng Ying
Ausgabe: 2001

ISBN/EAN: 9780387950921

Seitenzahl: 220
Format: 23,5 x 15,5 cm
Produktform: Hardcover/Gebunden
Gewicht: 1,110 g
Sprache: Englisch

buchhandel.de - Newsletter
Möchten Sie sich für den Newsletter anmelden?

Bitte geben Sie eine gültige E-Mail-Adresse ein.
Lieber nicht