论文信息 - Factorizing Proofs in Timed CSP

Factorizing Proofs in Timed CSP

A simple notion of specification is introduced, and a complete set of inference rules given, for reasoning about real-time processes. The notation of Timed Communicating Sequential Processes is employed, and the strongest possible specification of a process is discussed. A proof of correctness of a simple protocol is given to illustrate the method of verification.

Jim Davies | Steve A. Schneider | S. Schneider | J. Davies | J. Davies

[1] C. A. R. Hoare,et al. A Model for Communicating Sequential Processes , 1980, On the Construction of Programs.

[2] C. A. R. Hoare,et al. Communicating sequential processes , 1978, CACM.

[3] G. M. Reed. A uniform mathematical theory for real-time distributed computingT , 1988 .

[4] A. W. Roscoe,et al. Metric Spaces as Models for Real-Time Concurrency , 1987, MFPS.

[5] A. W. Roscoe,et al. A Timed Model for Communicating Sequential Processes , 1986, Theor. Comput. Sci..