Resolving race conditions in asynchronous partial order scenarios
Tools
Tools
Tools
Mitchell, Bill (2005) Resolving race conditions in asynchronous partial order scenarios IEEE Transactions on Software Engineering, 31 (9). pp. 767-784. ISSN 0098-5589
![[img]](/style/images/fileicons/application_pdf.png)
| PDF 850Kb |
Abstract
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.
| Item Type: | Article |
|---|---|
| Additional Information: | In IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 31, pp. 767- 784.© 2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 1986 |
| Deposited By: | Mr Adam Field |
| Deposited On: | 27 May 2010 15:46 |
| Last Modified: | 26 Sep 2012 14:37 |
Document Downloads
Repository Staff Only: item control page