Muutke küpsiste eelistusi

Introduction to Concurrency Theory: Transition Systems and CCS 1st ed. 2015 [Kõva köide]

,
  • Formaat: Hardback, 334 pages, kõrgus x laius: 235x155 mm, kaal: 6447 g, 63 Illustrations, black and white; XI, 334 p. 63 illus., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 11-Sep-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 331921490X
  • ISBN-13: 9783319214900
Teised raamatud teemal:
  • Kõva köide
  • Hind: 48,70 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 57,29 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
Introduction to Concurrency Theory: Transition Systems and CCS 1st ed. 2015Suurem pilt
  • Formaat: Hardback, 334 pages, kõrgus x laius: 235x155 mm, kaal: 6447 g, 63 Illustrations, black and white; XI, 334 p. 63 illus., 1 Hardback
  • Sari: Texts in Theoretical Computer Science. An EATCS Series
  • Ilmumisaeg: 11-Sep-2015
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 331921490X
  • ISBN-13: 9783319214900
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783319214900.html
Märksõnad:

This book presents the fundamentals of concurrency theory with clarity and rigor. The authors start with the semantic structure, namely labelled transition systems, which provides us with the means and the tools to express processes, to compose them, and to prove properties they enjoy. The rest of the book relies on Milner's Calculus of Communicating Systems, tailored versions of which are used to study various notions of equality between systems, and to investigate in detail the expressive power of the models considered.

The authors proceed from very basic results to increasingly complex issues, with many examples and exercises that help to reveal the many subtleties of the topic. The book is suitable for advanced undergraduate and graduate students in computer science and engineering, and scientists engaged with theories of concurrency.

Arvustused

This book is an introduction to labelled transition systems and the calculus of communicating systems (CCS) due to Robin Milner. It has been used in a master's course on concurrent systems. There are numerous examples and exercises. The book is very carefully written and covers a large amount of material at an introductory level, and a motivated student can use it for self-study. (Kamal Lodaya, Mathematical Reviews, May, 2016)

1 Introduction
1(20)
1.1 Motivation
1(6)
1.1.1 Sequentiality, Nondeterminism and Concurrency
2(3)
1.1.2 Interaction, Communication and Process Algebra
5(2)
1.2 Why This Book?
7(2)
1.2.1 Structure of the Book
8(1)
1.2.2 How to Use It
9(1)
1.3 Background
9(12)
1.3.1 Sets, Relations and Functions
10(3)
1.3.2 Alphabets, Strings, Languages and Regular Expressions
13(1)
1.3.3 Grammars and the Chomsky Hierarchy
14(2)
1.3.4 Finite Automata and Turing Machines
16(1)
1.3.5 Decidable and Semi-decidable Sets and Problems
17(4)
2 Transition Systems and Behavioral Equivalences
21(60)
2.1 Modeling a Reactive System
21(4)
2.2 Labeled Transition Systems
25(4)
2.3 Behavioral Equivalences
29(23)
2.3.1 Isomorphism
30(1)
2.3.2 Traces
31(5)
2.3.3 Simulation
36(7)
2.3.4 Bisimulation
43(9)
2.4 Abstracting from Invisible Actions
52(20)
2.4.1 Weak Traces
53(4)
2.4.2 Weak Simulation and Weak Bisimulation
57(9)
2.4.3 Branching Bisimulation
66(6)
2.5 Bisimilarity as a Fixed Point
72(9)
3 CCS: A Calculus of Communicating Systems
81(82)
3.1 A Language for Describing Reactive Systems
81(13)
3.1.1 An Informal Overview of CCS Operators
83(7)
3.1.2 Formal Syntax
90(4)
3.2 Structural Operational Semantics
94(6)
3.3 About Guardedness
100(5)
3.3.1 Guardedness Implies Finite Branching
100(1)
3.3.2 Unique Solution of Equations
101(4)
3.4 Some Subclasses of CCS Processes
105(33)
3.4.1 Finite CCS
107(3)
3.4.2 Finite-State CCS
110(3)
3.4.3 Regular CCS
113(11)
3.4.4 BPP: Basic Parallel Processes
124(5)
3.4.5 Finite-Net CCS
129(4)
3.4.6 Finitary CCS
133(5)
3.5 Turing-Completeness
138(13)
3.5.1 Counter Machines
138(2)
3.5.2 Encoding Counter Machines into Finitary CCS
140(3)
3.5.3 Undecidability of Behavioral Equivalences for Finitary CCS
143(3)
3.5.4 Undecidability of Bisimilarity for Finite-Net CCS
146(5)
3.6 Value-Passing CCS
151(12)
4 Algebraic Laws, Congruences and Axiomatizations
163(42)
4.1 Some Algebraic Laws
163(16)
4.1.1 Laws for Strong Equivalences
163(5)
4.1.2 Syntactic Substitution and Alpha-Conversion
168(7)
4.1.3 Laws for Weak Equivalences
175(4)
4.2 Congruence
179(9)
4.2.1 Strong Bisimulation Equivalence Is a Congruence
179(2)
4.2.2 Recursion
181(3)
4.2.3 Weak Equivalences Are Congruences
184(4)
4.3 Axiomatization of Finite Processes
188(17)
4.3.1 Equational Deduction
189(3)
4.3.2 Axiomatizing Strong Equivalences
192(4)
4.3.3 Axiomatizing Weak Equivalences
196(5)
4.3.4 Left Merge and Communication Merge
201(4)
5 Additional Operators
205(54)
5.1 Internal Choice
205(2)
5.2 Hiding
207(3)
5.3 Relabeling
210(3)
5.4 Sequential Composition
213(37)
5.4.1 Transition Systems with Final States
214(5)
5.4.2 Finite BPA
219(5)
5.4.3 BPA*: Finite BPA with Iteration
224(4)
5.4.4 BPA: Finite BPA with Recursion
228(5)
5.4.5 PA and PAER
233(4)
5.4.6 Derived Operator
237(13)
5.5 Replication
250(6)
5.5.1 Guarded Replication
254(2)
5.6 Multi-party Synchronization
256(3)
6 Multi-CCS
259(64)
6.1 Lack of Expressiveness of CCS
259(11)
6.1.1 Dining Philosophers Problem
259(4)
6.1.2 Strong Prefixing: An Operator for Atomicity
263(3)
6.1.3 Multi-party Synchronization
266(4)
6.2 Syntax and Operational Semantics
270(18)
6.2.1 Conservative Extension
276(3)
6.2.2 Well-Formed Processes
279(8)
6.2.3 Some Subclasses of Multi-CCS Processes
287(1)
6.3 Behavioral Semantics
288(14)
6.3.1 Interleaving Semantics
288(3)
6.3.2 Step Semantics
291(3)
6.3.3 Step Bisimilarity Implies Interleaving Bisimilarity
294(7)
6.3.4 Properties of the Step Semantics
301(1)
6.4 Case Studies
302(5)
6.4.1 Concurrent Readers and Writers
302(2)
6.4.2 Courteous Dining Philosophers
304(2)
6.4.3 Cigarette Smokers Problem
306(1)
6.5 Expressiveness
307(16)
6.5.1 Choice
308(4)
6.5.2 Relabeling
312(1)
6.5.3 CSP Multiway Synchronization
313(5)
6.5.4 Last Man Standing Problem
318(1)
6.5.5 Conclusion
319(4)
Glossary 323(2)
References 325(6)
Index 331
Roberto Gorrieri is a professor of computer science of the University of Bologna. His interests include concurrency and the foundations of security analysis and design.

Cristian Versari is an assistant professor of computer science at the Laboratoire d'Informatique Fondamentale de Lille (LIFL). His interests include concurrent languages and the computational modelling of biological systems.