Protocol analysis and synthesis by structured partitions
Computer Networks and ISDN Systems
A Test Design Methodology for Protocol Testing
IEEE Transactions on Software Engineering
Spanner: A Tool for the Specification, Analysis, and Evaluation of Protocols
IEEE Transactions on Software Engineering
Communicating sequential processes
Communications of the ACM
Formal verification of parallel programs
Communications of the ACM
Formal Description Technique Estelle: Results of the Esprit Sedos Project
Formal Description Technique Estelle: Results of the Esprit Sedos Project
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
An approach for evaluating formal description techniques
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
A formal comparison of formal protocol specification techniques
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
ADA, a well suited language for specification and implementation of protocols
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
Proceedings of the IFIP WG6.1 Fifth International Conference on Protocol Specification, Testing and Verification V
Systems of communicating machines: a model for communication protocols
Systems of communicating machines: a model for communication protocols
Reachability analysis of protocols with FIFO channels
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Maximal progress state exploration
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
A methodology for verifying request processing protocols
SIGCOMM '83 Proceedings of the symposium on Communications Architectures & Protocols
Specification and analysis of the SNR high-speed transport protocol
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
A model for communication protocols called systems of communicating machines is used to specify a data transfer protocol with variable window size (e.g., HDLC), which is an arbitrary nonnegative integer, and to analyze it for freedom from deadlocks. The model uses a combination of finite state machines and variables. This allows the size of the specification (i.e., number of states and variables) to be linear in the window size, a considerable reduction from the pure finite state machine model. A new type of analysis is demonstrated which we call system state analysis. This is similar to the reachability analysis used in the pure finite state model, but it provides substantial simplication by reducing the number of states generated. For example, with the protocol in this paper, if w is the window size, then the global analysis produces O(w5) states, while the system state analysis produces O(w3) states. The system state analysis is then combined with an inductive proof, extending the analysis to all nonnegative integers w.