Proving liveness for networks of communicating finite state machines
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
Constructing Protocols with Alternative Functions
IEEE Transactions on Computers - Special issue on protocol engineering
A partial approach to model checking
Papers presented at the IEEE symposium on Logic in computer science
Timed protocol verification for Estelle-specified protocols
ACM SIGCOMM Computer Communication Review
A discipline for constructing multiphase communication protocols
ACM Transactions on Computer Systems (TOCS)
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Improved Method for Constructing Multiphase Communications Protocols
IEEE Transactions on Computers
Validating Protocol Composition for Progress by Parallel Step Reachability Analysis
FORTE X / PSTV XVII '97 Proceedings of the IFIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE X) and Protocol Specification, Testing and Verification (PSTV XVII)
A decomposition method for the analysis and design of finite state protocols
SIGCOMM '83 Proceedings of the eighth symposium on Data communications
Structured design of communication protocols
ICDCS '96 Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS '96)
Partial-Order Validation for Multi-Process Protocols Modeled as Communicating Finite State Machines
ICNP '96 Proceedings of the 1996 International Conference on Network Protocols (ICNP '96)
A Compositional Approach for Designing Multifunction Time-Dependent Protocols
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Constraint-based structuring of network protocols
Distributed Computing
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Validation of protocols with temporal constraints
Computer Communications
Research: Protocol validation by simultaneous reachability analysis
Computer Communications
Protocol Verification via Projections
IEEE Transactions on Software Engineering
| Hi-index | 0.24 |
In protocol composition techniques, component protocols are combined in various ways to obtain a complex protocol whose execution sequences consist of interleaved execution sequences of the component protocols. In this paper, we investigate the problem of verifying liveness properties of the composite protocol from the known properties of its components. We first characterize a class of composite protocols that encompasses almost every composite protocol appeared in the literature. For verifying liveness properties of a composite protocol in the class, we then develop a sufficient condition to ensure that certain liveness properties of the component protocols carry over to the composite protocol. A verification technique, based on this sufficient condition, is then used to determine whether the liveness properties of the component protocols also hold for the composite protocol. The technique is applicable to any transition based protocol model as long as the model is susceptible to reachability analysis for the sake of correctness proofs. To demonstrate the usefulness of our technique, we apply it to a class of protocols that involves certain synchronizing constraints. This work shows a promising integration of a synthesis technique with an analytic method.