Specification and proof in real-time CSP

199 Pages·1993·2.031 MB·English

by  Jim Davies

SPECIFICATION AND PROOF IN REAL-TIME CSP
Distinguished Dissertations in Computer Science
Edited by
C.J. van Rijsbergen, University of Glasgow
The Conference of Professors of Computer Science (CPCS) in conjunction
with the British Computer Society (BCS), selects annually for publication up
to four of the best British Ph.D. dissertations in computer science. The scheme
began in 1990. Its aim is to make more visible the significant contribution
made by Britain - in particular by students - to computer science, and to
provide a model for future students. Dissertations are selected on behalf of
CPCS by a panel whose members are:
M. Clint, Queen1 s University, Belfast
R.J.M Hughes, University of Glasgow
R. Miner, University of Edinburgh (Chairman)
K. Moody, University of Cambridge
M.S. Paterson, University of Warwick
S. Shrivastava, University of Newcastle upon Tyne
A. Sloman, University of Birmingham
F. Sumner, University of Manchester
SPECIFICATION AND PROOF
IN REAL-TIME CSP
Jim Davies
University of Oxford
CAMBRIDGE
UNIVERSITY PRESS
Published by the Press Syndicate of the University of Cambridge
The Pitt Building, Trumpington Street, Cambridge CB2 1RP
40 West 20th Street, New York, NY 10011-4211, USA
10 Stamford Road, Oakleigh, Melbourne 3166, Australia
© Cambridge University Press 1993
First published 1993
Printed in Great Britain at the University Press, Cambridge
Library of Congress cataloguing in publication data available
A catalogue record for this book is available from the British Library
ISBN 0 521 45055 1
To my parents, for their love and support
&
to Alice, for everything

CONTENTS
Preface xi
Glossary xv
1 The Language of CSP 1
1.1 Communicating Sequential Processes 1
1.2 Timed models 3
1.3 A model of computation 5
1.4 Timed CSP 6
1.5 Example 7
2 The Timed Failures Model 9
2.1 Timed observations 9
2.2 Notation 10
2.3 The timed failures model 13
2.4 A semantic function 14
2.5 Sequential processes 15
2.6 Parallel processes 21
2.7 Timeouts and interrupts 24
2.8 Interaction 26
2.9 Example 27
3 Recursive Processes 29
3.1 Recursive definitions 29
3.2 Constructive terms 29
3.3 Recursive processes 32
3.4 Mutual recursion 35
3.5 Constructive vectors 37
Vlll
3.6 Equation sets 50
3.7 Examples 53
Specification 55
4.1 Behavioural specifications 55
4.2 Safety and liveness 59
4.3 Environmental conditions 63
4.4 Example 66
Proof 67
5.1 A proof system 67
5.2 Sequential processes 68
5.3 Parallel processes 73
5.4 Timeouts and interrupts 76
5.5 Recursive processes 77
5.6 Soundness and completeness 83
5.7 Timewise refinement 86
5.8 Example 94
Structuring Specifications 99
6.1 Abstraction 99
6.2 Scheduling 101
6.3 A specification language 105
6.4 Example 107
Case Study 111
7.1 A local area network protocol Ill
7.2 Layered protocols 112
7.3 The data link service 115
7.4 The data link specification 119
7.5 The physical service 126
7.6 Combination 130
7.7 Implementation 140
7.8 Discussion 143
Broadcast communication 145
8.1 Signals 145
8.2 Sequential processes 150
8.3 Signals and concurrency 155
8.4 Consistency 158
8.5 Example 163
IX
9 Discussion 167
9.1 Other approaches 167
9.2 Future work 169
9.3 Conclusions 171
Thanks 173
References 175