Abstract
Web services have been widely regarded as the next-generation distributed computing model. Their interoperability involves complex routing protocols. The routing protocol between interoperability, reflected the loose nature of contracts between services, will be stuck due to deadlock occurred in interaction channels when a routing protocol is executed. This may cause economic losses and have negative impact on the communications. Most existing approaches use cryptographic algorithms to protect data for securing the routes. However, these works cannot deal with dynamic behaviors validation. This paper adopts model checking technique to verify the correctness, analyzing the timed property of dynamic routing protocols. It extends the classical automaton models by qualifying the routing protocols as timed I/O automaton (TIOA), specifying the time constraints of interaction between Inputs and Outputs interface. The behavior of each interaction is annotated with execution time and guard condition. Concurrent routing protocols are modeled using synchronous product. After that, the timed properties, such as safety, liveness, reachability, are expressed as temporal logic formulae, namely, TCTL (Timed Computation Tree Logic, TCTL). The verification is performed under model checker UPPAAL. The experiment results show the significant advantage of our method.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call