5. Conclusion

    We can conclude from this paper that epistemic analysis is a powerful tool for designing and correcting already designed communication protocols as they provide visualisation and so better understanding of the transfer process. One of the results of this paper was that we can adapt notions like belief to describe the transfer process in a way that can accurately capture the states of the Sender and Receiver in the process and also that such an approach seems to accurately describe the notable differences between different types of protocols, in this case CUDP and TCP.

References:

[AUWY82] A. V. Aho, J. D. Ullman, A. D. Wyner, and M. Yannakakis. Bounds on the size and transmission rate of communication protocols. Computers and Mathematics with Applications, 8(3):205{214, 1982. This is a later version of [AUY79].

[AUY79] A. V. Aho, J. D. Ullman, and M. Yannakakis. Modeling communication protocols by automata. In Proc. 20th IEEE Symp. on Foundations of Computer Science, pages 267-273, 1979.

[BG77] G. V. Bochmann and J. Gecsei. A unifed method for the specifcation and verifcation of protocols. In B. Gilchrist, editor, Information Processing 77, pages 229-234.North-Holland, Amsterdam, 1977.

[BS80] G. V. Bochmann and C. A. Sunshine. Formal methods in communication protocol design. IEEE Transactions on Communications, COM-28:624-631, 1980.

[BSW69] K. A. Bartlett, R. A. Scantlebury, and P. T. Wilkinson. A note on reliable fullduplex transmission over half-duplex links. Communications of the ACM, 12:260-261, 1969.

[CES86] E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifcations. ACM Trans. on Programming Languages and Systems, 8(2):244{263, 1986. An early version appeared in
Proc. 10th ACM Symposium on Principles of Programming Languages, 1983.

[ChM85] M. Chandy & J. Misra, How Processes Learn, in: Proceedings of the 4thACM Symp. onPrinciples ofDistributed Computing, 1985, pp.204—214.
 

[CM86] K. M. Chandy and J. Misra. How processes learn. Distributed Computing, 1(1):40-52, 1986.

[DM90] C. Dwork and Y. Moses. Knowledge and common knowledge in a Byzantine envronment: crash failures. Information and Computation, 88(2):156-186, 1990.

[FHV92] R. Fagin, J. Y. Halpern, and M. Y. Vardi. What can machines know? On the properties of knowledge in distributed systems. Journal of the ACM, 39(2):328-376, 1992.

[FI86] M. J. Fischer and N. Immerman. Foundations of knowledge for distributed systems. In J. Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge:

[FV86] R. Fagin & M.Y. Vardi, Knowledge and Implicit Knowledge in a Distributed Environment, in: J.Y. Halpern (ed.), Proceedings of the 1st Conference on Theoretical Aspects of Knowledge, Morgan Kaufmann, Los Altos, 1986, pp. 187—206.

[GS80] V. D. Gligor and S. H. Shattuck. On deadlock detection in distributed systems. IEEE Transactions on Software Engineering, SE-6(5):435-440, 1980.

[Had87] V. Hadzilacos. A knowledge-theoretic analysis of atomic commitment protocols. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 129-134, 1987. A revised version has been submitted for publication.

[Hal87] J. Y. Halpern. Using reasoning about knowledge to analyze distributed systems. In J. F. Traub, B. J. Grosz, B. W. Lampson, and N. J. Nilsson, editors, Annual Review of Computer Science, Vol. 2, pages 37-68. Annual Reviews Inc., Palo Alto,
Calif., 1987.

[HO83] B. T. Hailpern and S. S. Owicki. Modular veri cation of communication protocols. IEEE Transactions on Communications, COM-31(1):56-68, 1983.

[HF85] J. Y. Halpern and R. Fagin. A formal model of knowledge, action, and communication in distributed systems: preliminary report. In Proc. 4th ACM Symp. on Principles of Distributed Computing, pages 224-236, 1985.

[HF89] J.Y. Halpem & R. Fagin, Modelling Knowledge and Action in Distributed Systems, Distributed Computing 3, 1989,pp. 159—177.

[HM84a] J.Y. Halpern & Y.O. Moses, Knowledge and Common Knowledge in a Distributed Environment, in: Proceedings of the 3rdACMSymp. on Principles of Distributed Computing, 1984a, pp. 50—61.

[HM90] J.Y. Halpern & Y.O. Moses, Knowledge and Common Knowledge in a Distributed Environment, J. ACM 37(3), 1990, pp. 549—587 (revised and expanded version of [HM84a]).

[HV86] J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. In Proc. 18th ACM Symp. on Theory of Computing, pages 304-315, 1986.

[HZ87] J.Y. Halpern & L.D. Zuck, A Little Knowledge Goes a Long Way: Simple Knowledge-Based Derivations and Correctness Proofs for a Family of Protocols, in: Proceedings of the 6th ACM Symp. onPronciples ofdistributed Computing, 1987,pp.269-280.

[JSTS94] K. Jeffay, D. L. Stone, T. Talley, and F. D. Smith, Adaptive, best-effort delivery of digital audio and video across packet switched networks, Network and Operating System Support for Digital Audio and Video: Third International Workshop, (La Jolla, California, USA, November 12-13, 1992), Springer-Verlag, Berlin; New York, pp. 1-12.

[K89] S. G. Kochan et. al, UNIX Networking, Hayden Books, Carmel, IN, 1989 .

[KT86] S. Katz & G. Taubenfeld, What Processes Know: Definitions and Proof Methods, in: Proceedings of the 5th ACM Symp. on Principles of Distributed Computing, 1986, pp. 249-262.

[LeG91]D. Le Gall, MPEG: a video compression standard for multimedia applications, Communications of the ACM, April 1991, Vol. 34, Num.4, pp. 46-58.

[LMRT90] K. Lodaya, M. Mukund, R. Ramanujam & P.S. Thiagarajan, Models and Logics for True Concurrency, SPIC Science Foundation, School of Mathematics, Technical Report TCS-90-3, Madras, 1990.

[LR86] R. E. Ladner and J. H. Reif. The logic of distributed protocols (preliminary report). In J. Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge: Proc. 1986 Conference, pages 207{222. Morgan Kaufmann, San Francisco, Calif.,
1986.

[Mer76] P. M. Merlin. A methodology for the design and implementation of communication protocols. IEEE Transactions on Communications, COM-24(4):614-621, 1976.

[MT88] Y. Moses and M. R. Tuttle. Programming simultaneous actions using common knowledge. Algorithmica, 3:121-169, 1988.

[MvdH04] J.Ch.Meyer, W. van der Hoek, Epistemic Logic for AI and Computer Science, 2004.

[NT93] G. Neiger and S. Toueg. Simulating real-time clocks and common knowledge in distributed systems. Journal of the ACM, 40(2):334-367, 1993.

[OL82] S. Owicki and L. Lamport. Proving liveness properties of concurrent programs.ACM Trans. on Programming Languages and Systems, 4(3):455-495, 1982.

[QS82] J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. 5th Int'l Symp. on Programming, Lecture Notes in Computer Science, Vol. 137, pages 337-371. Springer-Verlag, Berlin/New York, 1982.

[S94] B.C. Smith Cyclic-UDP: A Priority-Driven Best-Effort protocol

[SH86] S. R. Soloway and P. A. Humblet. On distributed network protocols for changing topologies. Technical Report LIDS-P-1564, MIT, 1986.

[SMS82] R. L. Schwartz and P. M. Melliar-Smith. From state machines to temporal logic: specification methods for protocol standards. IEEE Transactions on Communications, COM-30(12):2486-2496, 1982.

[Pnu77] A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symp. on Foundations of Computer Science, pages 46-57, 1977.

[PR85] R. Parikh and R. Ramanujam. Distributed processing and the logic of knowledge. In R. Parikh, editor, Proc. Workshop on Logics of Programs, pages 256{268, 1985.

[R93] K. K. Ramakrishnan, et. al., “Operating System Support for a Video on Demand File Service,” Network and Operating System Support for Digital Audio and Video: Fourth International Workshop, Lancaster, UK November 1993. Springer-Verlag,
Berlin; New York pp 225-236

[SJ93] D. Stone, K. Jeffay, Queue Monitoring: A Delay Jitter Management Policy, Network and Operating System Support for Digital Audio and Video: Fourth International Workshop, Lancaster, UK November,1993. Springer-Verlag, Berlin; New York pp. 151-162

[Ste76] M. V. Stenning. A data transfer protocol. Comput. Networks, 1:99-110, 1976.

[Sun79] C. A. Sunshine. Formal techniques for protocol speci cation and veri cation. IEEE Computer, 12:20-27, 1979.

[SV02] F. Stulp, R. Verbrugge A knowledge-based algorithm for the Internet protocol TCP, Bulletin of Economic Research, 2002 - Wiley Online Library

[vHM92] M. van Hulst & J.-J. Ch. Meyer, A Taxonomy of Knowledge in Distributed Systems, in: J.L.G. Dietz (ed.), Proceedings of Computer Science in the Netherlands '92, SION, Utrecht, 1992, pp. 42—53.