Message Sequence Charts in the Software Engineering Process

Mauw, Sjouke; Reniers, Michel A.; Willemse, Tim A. C.

doi:10.1142/9789812389718_0018

Cited by 25 publications

(17 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…According to Flat, it would be acceptable to select d1 with probability 1 2 , d2 with probability 3 8 , d3 with probability 1 16 and d4 with probability 1 16 . According to nested, this is not acceptable, since the probability of selecting one of d3 and d4 is then 1 8 , which is not a value in [ 1 4 , 1 2 ].…”

Section: The Palt Operator For Capturing Probabilistic Choicementioning

confidence: 99%

“…Sequence diagrams are used, for example, as specifications for programmers or as maintenance documentation, to verify and validate constraints with client representatives, and to clarify understanding of the application among technical members of a project team [1]. [3] shows how MSC (which are very similar to UML sequence diagrams) can be used in a number of different parts that occur in most software development methods.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Stepwise refinement of sequence diagrams with soft real-time constraints

Refsdal

Runde

Stølen

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

UML sequence diagrams and similar notations are much used to specify and analyze computer systems and their requirements. Probabilities are often essential, in particular for capturing soft real-time constraints. It is also important to be able to specify systems at different levels of abstraction. Refinement is a means to relate abstract specifications to more concrete specifications in such a way that constraints and analysis results are preserved through the transition. In order to allow soft real-time constraints to be included as an integral part of sequence diagram specifications, this paper presents an approach to extend UML 2.x sequence diagrams to capture probabilistic choice in general and soft real-time constraints in particular. The approach is supported by formal semantics and pragmatic refinement relations with mathematical properties that allow stepwise and modular development of specifications. An example focusing on communication is provided to demonstrate the language and refinement relations.

show abstract

Section: The Palt Operator For Capturing Probabilistic Choicementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Stepwise refinement of sequence diagrams with soft real-time constraints

Refsdal

Runde

Stølen

2015

Journal of Computer and System Sciences

View full text Add to dashboard Cite

show abstract

“…In this drawing we sketch a typical scenario of an Internet application which is called the Meeting Scheduler (see [22]). This is an application which assists in scheduling a meeting by keeping track of all suitable dates and sending appropriate requests and convocations to the intended participants of the meeting.…”

Section: Interactiollsmentioning

confidence: 99%

Specifying internet applications with DiCons

Baeten

Beek

Mauw

2001

Proceedings of the 2001 ACM Symposium on Applied Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…MSCs are widely used for requirements analysis and system design in the telecommunications and software industries [3,4,5,6,7]. MSCs include two forms of graphical models: basic MSCs (bMSCs) and High-level MSCs (HMSCs).…”

Section: Introductionmentioning

confidence: 99%

The Oracle Problem When Testing from MSCs

Dan

Hierons

2013

The Computer Journal

View full text Add to dashboard Cite

Message Sequence Charts (MSCs) form a popular language in which scenariobased specifications and models can be written. There has been significant interest in automating aspects of testing from MSCs. This paper concerns the Oracle Problem, in which we have an observation made in testing and wish to know whether this is consistent with the specification. We assume that there is an MSC specification and consider the case where we have entirely independent local testers (local observability) and where the observations of the local testers are logged and brought together (tester observability). It transpires that under local observability the Oracle Problem can be solved in low-order polynomial time if we use sequencing, loops and choices but becomes NP-complete if we also allow parallel components; if we place a bound on the number of parallel components then it again can be solved in polynomial time. For tester observability, the problem is NP-complete when we have either loops or choices. However, it can be solved in low-order polynomial time if we have only one loop, no choices, and no parallel components. If we allow parallel components then the Oracle Problem is NP-complete for tester observability even if we restrict to the case where there are at most two processes.

show abstract

Message Sequence Charts in the Software Engineering Process

Cited by 25 publications

References 12 publications

Stepwise refinement of sequence diagrams with soft real-time constraints

Stepwise refinement of sequence diagrams with soft real-time constraints

Specifying internet applications with DiCons

The Oracle Problem When Testing from MSCs

Contact Info

Product

Resources

About