论文信息 - A Theory for Protocol Validation

A Theory for Protocol Validation

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.

Gerard J. Holzmann

[1] Alan C. Shaw,et al. Software Descriptions with Flow Expressions , 1978, IEEE Transactions on Software Engineering.

[2] Daniel Brand,et al. Towards Analyzing and Synthesizing Protocols , 1980, IEEE Trans. Commun..

[3] Pitro Alois Zafiropulo,et al. Protocol Validation by Duologue-Matrix Analysis , 1978, IEEE Trans. Commun..

[4] Keith A. Bartlett,et al. A note on reliable full-duplex transmission over half-duplex links , 1969, Commun. ACM.

[5] Gregor von Bochmann,et al. Finite State Description of Communication Protocols , 1978, Comput. Networks.

[6] William C. Rounds,et al. Complexity of expressions allowing concurrency , 1978, POPL '78.

[7] Carl A. Sunshine,et al. Connection Management in Transport Protocols , 1978, Comput. Networks.

[8] Gregor V. Bochmann. Communication protocols and error recovery procedures , 1975 .

[9] Gregor von Bochmann,et al. Formal Methods in Communication Protocol Design , 1980, IEEE Trans. Commun..

[10] Robin Milner,et al. A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[11] Ming T. Liu,et al. A formal approach to the desin and implementation of network communication protocol , 1978, COMPSAC.

[12] P. Merlin,et al. Specification and Validation of Protocols , 1979, IEEE Trans. Commun..