Service‐Oriented Synthesis of Distributed and Concurrent Protocol Specifications

Abstract

Several methods have been proposed for synthesizing computer communication protocol specifications from service specifications. Some protocol synthesis methods based on the finite state machine (FSM) model assume that primitives in the service specifications cannot be executed simultaneously. Others either handle only controlled primitive concurrency or have tight restrictions on the applicable FSM topologies. As a result, these synthesis methods are not applicable to an interesting variety of inherently concurrent applications, such as the Internet and mobile communication systems. This paper proposes a concurrentbased protocol synthesis method that eliminates the restrictions imposed by the earlier methods. The proposed method uses a synthesis method to obtain a sequential protocol specification (P-SPEC) from a given service specification (S-SPEC). The resulting P-SPEC is then remodeled to consider the concurrency behavior specified in the S-SPEC, while guaranteeing that P-SPEC provides the specified service.

Time assignment for distributed service and protocol UML-based specifications

“…The used models include finite state machines [2,3], UML state machines [4], Petri-nets [1], and LOTOS-like [5].…”

“…Some of the service-oriented protocol synthesis methods consider the timing requirements given in the service specification [3,6], while others do not [1,2,4,5]. The method of dealing with timing constraints provided in the service specifications in [3,6] cannot be directly applied in this paper because a different model is used (i.e., Petri-nets and finite state machines).…”

“…Several protocol synthesis methods for different models have appeared in the literature such as in [1][2][3][4][5]. Only [5] considers the UML state machine model, but it does not consider timing requirements.…”

“…The extended transition synthesis rules is a final state in the composite state cs Or s 1 is a substate of cs and s2 is not a substate of cs Or s 1 is a composite state (s 1 =cs) SAP i E/!e x [min t -min j X (min(d ij )), max t -max j X (max (d ij ))] if x≠Ø E [min t , max t ] if x=Ø…”

State‐expansion‐based techniques for synthesizing concurrent protocol specifications in distributed systems

“…In addition, the syntactic correctness of the synthesized protocol is often a direct byproduct of the synthesis method. Several protocol synthesis methods have appeared in the literature, such as those in [3][4][5][6][7][8][9]. The methods introduced in [4, 7] are either not based on the FSM model or only support sequential applications.…”