国部酒城礼品(福建)有限公司出品属白.pptVIP

* * * * * * * * * * * * * * * * * * * * * * * * * * * * Color the classes? Explain from left to right * * * * * * * * * * * * * * * * * Now most static BPEL statements can be translated into Guarded Automata in a very straightfowrd way. Each static BPEL statement can be translated into a guarded automaton, with one single entry, one single exit, and several exception exit points. For example, an assignment can be translated into a one transition automaton, where the guard does the assignment; and an composite statement like sequence can be constructed by composing the guarded automata for its sub-statements. * * * * * * * * * * * * * * * * * * * * * Bottom-Up vs. Top-Down Bottom-up approach Specify the behavior of each peer For example using an orchestration language such as WS-BPEL The global communication behavior (conversation set) is implicitly defined based on the composed behavior of the peers Global communication behavior is hard to understand and analyze Top-down approach Specify the global communication behavior (conversation set) explicitly as a protocol For example using a choreography language such as WS-CDL Ensure that the conversations generated by the peers obey the protocol Conversation Protocol GF(T-X(P) ? X-T(P)) ? LTL property Input Queue ... Virtual Watcher ? LTL property Peer T Peer X Peer J J-T(D) J-X(D) T-X(P) X-T(P) GF(T-X(P) ? X-T(P)) !J-T(D) !J-X(D) ?X-T(P) ?J-T(D) !T-X(P) ?T-X(P) ?J-X(D) !X-T(P) Top-Down vs. Bottom-Up Conversation Protocols Conversation Protocol: An automaton that accepts the desired conversation set A conversation protocol is a contract agreed by all peers Each peer must act according to the protocol For reactive protocols with infinite message sequences use: Büchi automata which accept infinite strings For specifying message contents, use: Guarded automata Guards are constraints on the message contents Synthesize Peer Implementations Conversation protocol specifies the global communication behavior How do we imple