Glossary |
|
viii | |
Preface |
|
x | |
Part I: Communicating Systems |
|
1 | (74) |
|
|
3 | (5) |
|
|
8 | (8) |
|
|
8 | (2) |
|
|
10 | (1) |
|
The language of an automaton |
|
|
11 | (1) |
|
Determinism versus nondeterminism |
|
|
12 | (1) |
|
Black boxes, or reactive systems |
|
|
13 | (2) |
|
|
15 | (1) |
|
Sequential Processes and Bisimulation |
|
|
16 | (10) |
|
Labelled transition systems |
|
|
16 | (1) |
|
|
17 | (1) |
|
|
18 | (2) |
|
Sequential process expressions |
|
|
20 | (2) |
|
|
22 | (1) |
|
|
23 | (1) |
|
|
24 | (1) |
|
|
25 | (1) |
|
Concurrent Processes and Reaction |
|
|
26 | (12) |
|
|
26 | (1) |
|
Observations and reactions |
|
|
27 | (2) |
|
Concurrent process expressions |
|
|
29 | (2) |
|
|
31 | (2) |
|
|
33 | (4) |
|
|
37 | (1) |
|
Transitions and Strong Equivalence |
|
|
38 | (14) |
|
|
38 | (7) |
|
Strong bisimilarity and applications |
|
|
45 | (3) |
|
Algebraic properties of strong equivalence |
|
|
48 | (2) |
|
|
50 | (1) |
|
|
51 | (1) |
|
Observation Equivalence: Theory |
|
|
52 | (8) |
|
|
52 | (1) |
|
|
53 | (5) |
|
Unique solution of equations |
|
|
58 | (1) |
|
|
59 | (1) |
|
Observation Equivalence: Examples |
|
|
60 | (15) |
|
|
60 | (1) |
|
|
61 | (3) |
|
|
64 | (3) |
|
|
67 | (2) |
|
|
69 | (4) |
|
|
73 | (2) |
Part II: The π-Calculus |
|
75 | (82) |
|
|
77 | (10) |
|
|
79 | (1) |
|
|
80 | (3) |
|
Other examples of mobility |
|
|
83 | (3) |
|
|
86 | (1) |
|
The π-Calculus and Reaction |
|
|
87 | (11) |
|
Names, actions and processes |
|
|
87 | (2) |
|
Structural congruence and reaction |
|
|
89 | (2) |
|
|
91 | (2) |
|
|
93 | (1) |
|
|
94 | (2) |
|
|
96 | (1) |
|
|
97 | (1) |
|
Applications of the π-Calculus |
|
|
98 | (15) |
|
|
98 | (2) |
|
|
100 | (3) |
|
|
103 | (3) |
|
|
106 | (3) |
|
Persistent and mutable data |
|
|
109 | (4) |
|
Sorts, Objects, and Functions |
|
|
113 | (16) |
|
A hierarchy of channel types? |
|
|
113 | (1) |
|
|
114 | (2) |
|
Extending the sort language |
|
|
116 | (3) |
|
Object-oriented programming |
|
|
119 | (4) |
|
Processes and abstractions as messages |
|
|
123 | (2) |
|
Functional computing as name-passing |
|
|
125 | (4) |
|
Commitments and Strong Bisimulation |
|
|
129 | (13) |
|
Abstractions and concretions |
|
|
129 | (3) |
|
|
132 | (2) |
|
Strong bisimulation, strong equivalence |
|
|
134 | (2) |
|
|
136 | (2) |
|
Basic congruence properties of replication |
|
|
138 | (2) |
|
|
140 | (1) |
|
|
141 | (1) |
|
Observation Equivalence and Examples |
|
|
142 | (11) |
|
|
142 | (1) |
|
Weak bisimulation and congruence |
|
|
143 | (2) |
|
Unique solution of equations |
|
|
145 | (1) |
|
|
146 | (1) |
|
|
147 | (1) |
|
|
148 | (3) |
|
Reduction in the λ-calculus |
|
|
151 | (2) |
|
Discussion and related work |
|
|
153 | (4) |
References |
|
157 | (2) |
Index |
|
159 | |