Extensions to communicating sequential processes to allow protocol performance specification

Authors:
J. J. Zic
Affiliations:
Univ. of Sydney, Australia
Venue:
SIGCOMM '87 Proceedings of the ACM workshop on Frontiers in computer communications technology
Year:
1987

Citing 6
Cited 0

Executable description of the OSI transport service in Prolog

Proc. of IFIP WG 6.1 4th Int'l Workshop on Protocol specification, testing, and verification, IV
A timed model for communicating sequential processes

International Colloquium on Automata, Languages and Programming on Automata, languages and programming
Systematic software development using VDM

Systematic software development using VDM
Specification-oriented programming in TCSP

Logics and models of concurrent systems
A Calculus of Communicating Systems

A Calculus of Communicating Systems
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Formalisms based on Hoare's Communicating Sequential Processes (CSP) and Milner's Calculus of Communicating Systems (CCS) for verifying protocols are currently being used by the International Standard Organisation (ISO). However, these models need to be extended if protocol performance specification and verification is to be done, as neither of these models have timing information (other than sequencing) nor a way of specifying controlled loss of information.This paper presents two extensions to Hoare's CSP that are felt by the author to provide suitable mechanisms for specifying protocol performance. Firstly, the effects of introducing time into CSP are presented, based on the work done by Reed and Roscoe. Secondly, the traces model is modified by associating probabilities with event sequences.Finally, some example specifications are given using these two extensions.