Skip to main content
SpringerLink
Log in
Book cover

Int. Spring School on Mathematical Methods of Specification and Synthesis of Software Systems

MMSSS 1985: Mathematical Methods of Specification and Synthesis of Software Systems '85 pp 9–23Cite as

Verification of an alternating bit protocol by means of process algebra protocol

  • Lectures
  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 215))

Abstract

We verify a simple version of the alternating bit protocol in the system ACPτ (Algebra of Communicating Processes with silent actions) augmented with Koomen's fair abstraction rule.

This work was sponsored in part by ESPRIT contract 432 METEOR.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. DE BAKKER, J.W. & J.I. ZUCKER, Compactness in semantics for merge and fair merge, Report IW 238/83, Mathematisch Centrum Amsterdam 1983.

    Google Scholar 

  2. BARTLETT, K.A., R.A. SCANTLEBURY & P.T. WILKINSON, A note on reliable full-duplex transmission over half duplex lines, CACM 12, No.5 (1969).

    Google Scholar 

  3. BERGSTRA, J.A. & J.W. KLOP, Process Algebra for Synchronous Communication, Information and Control, Vol.60, Nos.1–3, 1984, 109–137.

    Google Scholar 

  4. BERGSTRA, J.A. & J.W. KLOP, Algebra of Communicating Processes, to appear in Proc. of the CWI Symposium Mathematics and Computer Science (eds. J.W. de Bakker, M. Hazewinkel and J.K. Lenstra), North-Holland, Amsterdam 1985.

    Google Scholar 

  5. BERGSTRA, J.A. & J.W. KLOP, Algebra of Communicating Processes with abstraction, to appear in Theoretical Computer Science, 1985.

    Google Scholar 

  6. HAILPERN, B.T., Verifying concurrent processes using temporal logic. Springer LNCS 129, 1982.

    Google Scholar 

  7. HAILPERN, B.T. & S. OWICKI, Verifying network protocole using temporal logic, in: Trends and applications symposium, National Bureau of Standards 1980.

    Google Scholar 

  8. LAMPORT, L., Specifying concurrent program modules, ACM Toplas, Vol.5, No.2, p.190–222.

    Google Scholar 

  9. MILNER, R., A Calculus of Communicating Systems, Springer LNCS 92, 1980.

    Google Scholar 

  10. SCHWARTZ, R.L. & P. MELIAR SITH, From state machine to temperal logic, specification methods for protocol standards, IEEE Transactions on communication, Vol.30, No.12 (1982) p.2486–2496.

    Google Scholar 

  11. YEMINI, Y. & J.F. KUROSE, Can current protocol verification techniques guarantee correctness? Computer networks, Vol.6, No.6 (1982), p. 377–381.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centre for Mathematics and Computer Science, P.O.Box 4079, 1009 AB, Amsterdam, The Netherlands

    J. A. Bergstra & J. W. Klop

Authors
  1. J. A. Bergstra
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. W. Klop
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Klaus P. Jantke

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bergstra, J.A., Klop, J.W. (1986). Verification of an alternating bit protocol by means of process algebra protocol. In: Bibel, W., Jantke, K.P. (eds) Mathematical Methods of Specification and Synthesis of Software Systems '85. MMSSS 1985. Lecture Notes in Computer Science, vol 215. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16444-8_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-16444-8_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16444-9

  • Online ISBN: 978-3-540-39784-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation