Race conditions in message sequence charts
UNSPECIFIED (2005) Race conditions in message sequence charts. In: 3rd Asian Symposium on Programming Languages and Systems, Univ Tsukuba, Tsukuba, JAPAN, NOV 02-05, 2005. Published in: PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 3780 pp. 195-211.Full text not available from this repository.
Message Sequence Charts (MSCs) are a graphical language for the description of scenarios in terms of message exchanges between communicating components in a distributed environment. The language has been standardised by the ITU and given a formal semantics by means of a process algebra. In this paper, we review a design anomaly, called race condition, in an MSC specification and argue that the current solution correcting race conditions is too weak when implementation is considered. In this paper, we provide an algorithm on partial orders as our solution. The result is a strengthened partial order, which is race-free and remains race-free in the implementation.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS|
|Number of Pages:||17|
|Page Range:||pp. 195-211|
|Title of Event:||3rd Asian Symposium on Programming Languages and Systems|
|Location of Event:||Univ Tsukuba, Tsukuba, JAPAN|
|Date(s) of Event:||NOV 02-05, 2005|
Actions (login required)