Pattern-oriented software architecture: a system of patterns
Pattern-oriented software architecture: a system of patterns
The Unified Modeling Language user guide
The Unified Modeling Language user guide
LSCs: Breathing Life into Message Sequence Charts
Formal Methods in System Design
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
A hierarchy of communication models for message sequence charts
Science of Computer Programming
What Do Message Sequence Charts Mean?
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
Using Extended Event Traces to Describe Communication in Software Architectures
APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
ISORC '00 Proceedings of the Third IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Triggered Message Sequence Charts
IEEE Transactions on Software Engineering
Formal Specification Generation from Requirement Documents
Electronic Notes in Theoretical Computer Science (ENTCS)
Automatic generation of conformance tests from message sequence charts
SAM'02 Proceedings of the 3rd international conference on Telecommunications and beyond: the broader applicability of SDL and MSC
A generic theorem prover of CSP refinement
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 0.00 |
We propose an extension to Message Sequence Charts (MSC); MSC diagrams comprise processes (called instances) and messages. Messages in MSC are either asynchronous or method calls. Our extension adds multiple synchronous messages. We present a transformation algorithm that takes as input a diagram in the extended MSC and generates an equivalent one in the standard MSC. The synchronous messages are transformed to the standard notation via the introduction of several control messages. We also define a semantics for MSC (both the standard and our extension) using the process algebra CSP. Both instances and messages in MSC are characterised as CSP processes. This semantics allows us to formally establish the equivalence between an extended MSC diagram and its corresponding standard diagram (generated by the transformation algorithm). Although our strategy is application independent, the motivation came from an attempt to generate test scripts from MSC diagrams describing the behaviour of mobile phone devices.