This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Resolving Race Conditions in Asynchronous Partial Order Scenarios
September 2005 (vol. 31 no. 9)
pp. 767-784
Scenario-based requirements specifications are the industry norm for defining communication protocols. However, such scenarios often contain race conditions. A race condition occurs when events are specified to occur in a particular order, but in practice, this order cannot be guaranteed. The paper considers UML/MSC scenarios that can be described with standard partial order theoretic asynchronous behavioral semantics. We define these to be partial order scenarios. The paper proves there is a unique minimal generalization of a partial order scenario that is race free. The paper also proves there is a unique minimal race free refinement of the behavioral semantics of a partial order scenario. Unlike the generalization, the refinement cannot be realized in the form of a partial order scenario, although it can always be embedded in one. The paper also proves the results can be generalized to a subclass of iterative scenarios.
Index Terms:
Index Terms- Requirements analysis, formal methods, distributed programming.
Citation:
Bill Mitchell, "Resolving Race Conditions in Asynchronous Partial Order Scenarios," IEEE Transactions on Software Engineering, vol. 31, no. 9, pp. 767-784, Sept. 2005, doi:10.1109/TSE.2005.104
Usage of this product signifies your acceptance of the Terms of Use.