A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Complexity of expressions allowing concurrency
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Communication protocols and error recovery procedures
Proceedings of the 1975 ACM SIGCOMM/SIGOPS workshop on Interprocess communications
Software Descriptions with Flow Expressions
IEEE Transactions on Software Engineering
Trust by workflow in autonomic communication
MMM-ACNS'05 Proceedings of the Third international conference on Mathematical Methods, Models, and Architectures for Computer Network Security
Research: Throughput efficiency of an enhanced link management procedure
Computer Communications
| Hi-index | 0.00 |
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.