Tight bounds for the sequence transmission problem
暂无分享,去创建一个
[1] Michael J. Fischer,et al. Reasoning about Uncertainty in Fault-tolerant Distributed Systems , 1988, FTRTFT.
[2] Alfred V. Aho,et al. Modeling communications protocols by automata , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).
[3] Ronald Fagin,et al. Modelling knowledge and action in distributing systems: preliminary report , 1988 .
[4] Joseph Y. Halpern,et al. A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols , 1992, JACM.
[5] Joseph Y. Halpern. USING REASONING ABOUT KNOWLEDGE TO ANALYZE DISTRIBUTED SYSTEMS , 1987 .
[6] Joseph Y. Halpern,et al. Knowledge and common knowledge in a distributed environment , 1984, JACM.
[7] William R. Crowther,et al. The Data Transfer Protocol , 1971, RFC.
[8] David E. Carlson,et al. Bit-Oriented Data Link Control , 1982 .
[9] Alfred V. Aho,et al. Bounds on the size and transmission rate of communications protocols , 1982 .
[10] Ronald Fagin,et al. Modelling Knowledge and Action in Distributed Systems , 1988, Concurrency.
[11] Keith A. Bartlett,et al. A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.
[12] H. Zimmermann,et al. OSI Reference Model - The ISO Model of Architecture for Open Systems Interconnection , 1980, IEEE Transactions on Communications.
[13] Nancy A. Lynch,et al. Data link layer: two impossibility results , 1988, PODC '88.