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

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