A Theory for Protocol Validation
- 1 August 1982
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-31 (8) , 730-738
- https://doi.org/10.1109/tc.1982.1676079
Abstract
This paper introduces a simple algebra for the validation of communication protocols in message passing systems. The behavior of each process participating in a communication is first modeled in a finite state machine. The symbol sequences that can be accepted by these machines are then expressed in "protocol expressions," which are defined as regular expressions extended with two new operators: division and multiplication. The interactions of the machines can be analyzed by combining protocol expressions via multiplication and algebraically manipulating the terms.Keywords
This publication has 7 references indexed in Scilit:
- Specification and Validation of ProtocolsIEEE Transactions on Communications, 1979
- Connection management in transport protocolsComputer Networks (1976), 1978
- Protocol Validation by Duologue-Matrix AnalysisIEEE Transactions on Communications, 1978
- Software Descriptions with Flow ExpressionsIEEE Transactions on Software Engineering, 1978
- Complexity of expressions allowing concurrencyPublished by Association for Computing Machinery (ACM) ,1978
- Communication protocols and error recovery proceduresACM SIGOPS Operating Systems Review, 1975
- A note on reliable full-duplex transmission over half-duplex linksCommunications of the ACM, 1969