英语论文网

133
7.6 Procedure Rules 140
7.7 Summary 160
Exercises 160
Bibliographic Notes 161
8. Finite State Machines
8.1 Introduction 162
8.2 Informal Description 162
8.3 Formal Description 169
8.4 Execution of Machines 170
8.5 Minimization of Machines 171
8.6 The Conformance Testing Problem 174
8.7 Combining Machines 175
8.8 Extended Finite State Machines 176
8.9 Generalization of Machines 178
8.10 Restricted Models 181
8.11 Summary 184
Exercises 185
Bibliographic Notes 185
Part III — Conformance Testing, Synthesis and Validation
9. Conformance Testing
9.1 Introduction 187
9.2 Functional Testing 188
9.3 Structural Testing 189
9.4 Deriving UIO Sequences 195
9.5 Modified Transition Tours 196
9.6 An Alternative Method 197
9.7 Summary 199
Exercises 200
Bibliographic Notes 200
10. Protocol Synthesis
10.1 Introduction 203
10.2 Protocol Derivation 203
10.3 Derivation Algorithm 208
10.4 Incremental Design 210
10.5 Place Synchronization 210
10.6 Summary 211
Exercises 212
Bibliographic Notes 212
11. Protocol Validation
11.1 Introduction 214
11.2 Manual Proof Method 214
11.3 Automated Validation Methods 218
11.4 The Supertrace Algorithm 226
11.5 Detecting Non-Progress Cycles 231
11.6 Detecting Acceptance Cycles 234
11.7 Checking Temporal Claims 235
11.8 Complexity Management 235
11.9 Boundedness of PROMELAModels 237
11.10 Summary 238
Exercises 239
Bibliographic Notes 240
Part IV — Design Tools
12. A Protocol Simulator
12.1 Introduction 243
12.2 SPIN — Overview 244
12.3 Expressions 245
12.4 Variables 255
12.5 Statements 265
12.6 Control Flow 275
12.7 Process and Message Types 282
12.8 Macro Expansion 292
12.9 SPIN Options 293
12.10 Summary 294
Exercises 295
Bibliographic Notes 296
13. A Protocol Validator
13.1 Introduction 297
13.2 Structure of the Validator 298
13.3 The Validation Kernel 299
13.4 The Transition Matrix 302
13.5 The Validator-Generator Code 303
13.6 Overview of the Code 306
13.7 Guided Simulation 308
13.8 Some Applications 310
13.9 Coverage in Supertrace Mode 315
13.10 Summary 316
Exercises 316
Bibliographic Notes 317
14. Using the Validator
14.1 Introduction 318
14.2 An Optical Telegraph Protocol 318
14.3 Dekker’s Algorithm 320
14.4 A Larger Validation 322
14.5 Flow Control Validation 325
14.6 Session Layer Validation 336
14.7 Summary 349
Exercises 349
Bibliographic Notes 349
Conclusion 351
References 352
Appendices
A. Data Transmission 367
B. Flow Chart Language 380
C. PROMELA Language Report 383
D. SPIN Simulator Source 393
E. SPIN Validator Source 436
F. PROMELA File Transfer Protocol 528
Name Index 537
Subject Index 539

INTRODUCTION 1
1 Early Beginnings 1.1
9 The First Networks 1.2
12 Protocols as Languages 1.3
13 Protocol Standardization 1.4
15 Summary 1.5
16 Exercises
16 Bibliographic Notes
1.1 EARLY BEGINNINGS
The problem of designing efficient and unambiguous communication protocols
existed long before the first computers were built. There is a long history of attempts
to construct systems for transferring information quickly over long distances. From a
protocol designer’s point of view, the mishaps that were caused by misinterpreted
communications are fascinating. Of course, the problems of the ear本论文由英语论文网提供整理，提供论文代写，英语论文代写，代写论文，代写英语论文，代写留学生论文，代写英文论文，留学生论文代写相关核心关键词搜索。