Generating statechart designs from scenarios
Proceedings of the 22nd international conference on Software engineering
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
Synthesis of Behavioral Models from Scenarios
IEEE Transactions on Software Engineering
Message Sequence Graphs and Decision Problems on Mazurkiewicz Traces
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
What Do Message Sequence Charts Mean?
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
An Algebraic Semantics for Message Sequence Chart Documents
FORTE XI / PSTV XVIII '98 Proceedings of the FIP TC6 WG6.1 Joint International Conference on Formal Description Techniques for Distributed Systems and Communication Protocols (FORTE XI) and Protocol Specification, Testing and Verification (PSTV XVIII)
Syntactic Detection of Process Divergence and Non-local Choice inMessage Sequence Charts
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Inference of Message Sequence Charts
IEEE Transactions on Software Engineering
A Process-Based Semantics for Message Sequence Charts with Data
ASWEC '05 Proceedings of the 2005 Australian conference on Software Engineering
Inherent causal orderings of partial order scenarios
ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
On the realizability of collaborative services
Software and Systems Modeling (SoSyM)
Hi-index | 0.00 |
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.