Communicating sequential processes
Communicating sequential processes
Fairness
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
End-to-end communication in unreliable networks
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Data link layer: two impossibility results
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Computer networks
A proof of the Kahn principle for input/output automata
Information and Computation
Tight bounds for the sequence transmission problem
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Source to destination communication in the presence of faults
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Tight bounds for weakly bounded protocols
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Specifying modules to satisfy interfaces: a state transition system approach
Specifying modules to satisfy interfaces: a state transition system approach
On the development of reactive systems
Logics and models of concurrent systems
The need for headers: an impossibility result for communication over unreliable channels
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Journal of the ACM (JACM)
The impossibility of implementing reliable communication in the face of crashes
Journal of the ACM (JACM)
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Games I/O Automata Play (Extended Abstract)
CONCUR '92 Proceedings of the Third International Conference on Concurrency Theory
DISTRIBUTED ALGORITHMS , Lecture Notes for 6.852 FALL 1992
DISTRIBUTED ALGORITHMS , Lecture Notes for 6.852 FALL 1992
The intractability of bounded protocols for on-line sequence transmission over non-FIFO channels
Journal of the ACM (JACM)
Designing algorithms for distributed systems with partially synchronized clocks
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Recoverable sequence transmission protocols
Journal of the ACM (JACM)
Crash Resilient Communication in Dynamic Networks
IEEE Transactions on Computers
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
The complexity of end-to-end communication in memoryless networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Trade-off results for connection management
Theoretical Computer Science
Quiescent Uniform Reliable Broadcast as an Introduction to Failure Detector Oracles
PaCT '01 Proceedings of the 6th International Conference on Parallel Computing Technologies
Short Headers Suffice for Communication in a DAG with Link Failures
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
Tight Size Bounds for Packet Headers in Narrow Meshes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Agreement Problems in Fault-Tolerant Distributed Systems
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Feasibility and complexity of broadcasting with random transmission failures
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Header-size lower bounds for end-to-end communication in memoryless networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Web dynamics
Feasibility and complexity of broadcasting with random transmission failures
Theoretical Computer Science
Theoretical Computer Science
Verification and improvement of the sliding window protocol
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Modelling and verification of web services business activity protocol
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Synchronous consensus under hybrid process and link failures
Theoretical Computer Science
Causing communication closure: safe program composition with Non-FIFO channels
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.01 |