Abstract
The alternating bit protocol is taken as a case study of a parallel distributed system, and it is shown how the dataflow algebra approach can be used to specify and then analyse the overall behaviour of a communications system that uses this protocol. The paper summarises the use of dataflow algebras for specifying such systems, and introduces the main features of the protocol that are relevant to the case study. Models are developed for two different cases of the behaviour of the system, distinguished by different conditions on the length of the timeout period that is integral to the operation of the protocol. It is shown that under one of these conditions the overall operation of the protocol is such that it can not be guaranteed to operate correctly, even though the individual processes may operate correctly. A brief comparison is made between the use of the dataflow algebra approach for carrying out such analyses and the use of process algebra models.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bartlett, K., Scantlebury, R. and Wilkinson, W. (1969) A Note on Reliable Full-duplex Transmission over Half-duplex Links. Communications of the ACM, 12, 260–261.
Bezem, M.A. and Groote, J.F. (1994) A Correctness Proof of a One-bit Sliding Window Protocol in µCRL. Computer Journal, 37, 289–307.
C.C.T.A. (1990) SSADM version 4 reference manual. NCC Blackwell, Oxford.
Cowling, A.J. (1995) Dataflow Algebras as Formal Specifications of Data Flows. University of Sheffield Department of Computer Science Research Report CS-95–18.
Goguen, J.A. and Winkler, T (1988) Introducing OBJ3. Technical Report SRI-CSL-88–9, SRI International, Menlo Park, CA.
Goguen, J.A. (1991) Types as Theories, in Topology and Category Theory in Computer Science (eds. G.M. Reed, A.W. Roscoe and R.F. Wachter), Oxford University Press, Oxford.
Hoare, C.A.R. (1985) Communicating Sequential Processes. Prentice Hall, Englewood Cliffs, NJ.
Jacobson, I., Christerson, M., Jonsson, P. and Övergaard, G. (1992) Object-Oriented Software Engineering: A Use Case Driven Approach. Addison-Wesley, Wokingham.
Kastens, U. (1991) Attribute Grammars as a Specification Method, in Attribute Grammars, Applications and Systems (eds. H. Alblas and B. Melichar), Lecture Notes in Computer Science 545, Springer-Verlag, Berlin.
Knuth, D.E. (1968) Semantics of Context-Free languages. Mathematical Systems Theory, 2, 127–145.
Milner, R. (1983) Communication and Concurrency. Prentice Hall, Englewood Cliffs, NJ.
Yourdon, E. (1989) Modern Structured Analysis. Prentice Hall, Englewood Cliffs, NJ.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 IFIP International Federation for Information Processing
About this chapter
Cite this chapter
Cowling, A.J., Nike, M.C. (1996). Using dataflow algebra to analyse the alternating bit protocol. In: Jelly, I., Gorton, I., Croll, P. (eds) Software Engineering for Parallel and Distributed Systems. IFIP Advances in Information and Communication Technology. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34984-8_17
Download citation
DOI: https://doi.org/10.1007/978-0-387-34984-8_17
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-5041-2948-0
Online ISBN: 978-0-387-34984-8
eBook Packages: Springer Book Archive