A Hierarchy of Communication Models for Message Sequence Charts

Engels, André; Mauw, Sjouke; Reniers,

doi:10.1007/978-0-387-35271-8_5

Cited by 8 publications

(3 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The main rationale for introducing the three event semantics in Timed STAIRS is to be able to distinguish between reception and consumption of messages in order to specify time-constraints on black-box behavior as well as message consumption. Hence, the purpose of the three event semantics is quite different from [EMR97] where time and black-box behavior is not considered.…”

Section: Conclusion and Related Workmentioning

confidence: 99%

Why Timed Sequence Diagrams Require Three-Event Semantics

Haugen¹,

Husa²,

Runde³

et al. 2005

Scenarios: Models, Transformations and Tools

View full text Add to dashboard Cite

Abstract. STAIRS is an approach to the compositional development of sequence diagrams supporting the specification of mandatory as well as potential behavior. In order to express the necessary distinction between black-box and glass-box refinement, an extension of the semantic framework with three event messages is introduced. A concrete syntax is also proposed. The proposed extension is especially useful when describing time constraints. The resulting approach, referred to as Timed STAIRS, is formally underpinned by denotational trace semantics. A trace is a sequence of three kinds of events: events for transmission, reception and consumption. We argue that such traces give the necessary expressiveness to capture the standard UML interpretation of sequence diagrams as well as the black-box interpretation found in classical formal methods.

show abstract

Section: Conclusion and Related Workmentioning

confidence: 99%

Why Timed Sequence Diagrams Require Three-Event Semantics

Haugen¹,

Husa²,

Runde³

et al. 2005

Scenarios: Models, Transformations and Tools

View full text Add to dashboard Cite

show abstract

“…Communication between the runs is asynchronous (buffered). In order to conveniently model the intruder behaviour, we will route communication through two buffers: one output buffer from the sending run and one input buffer from the receiving run (for a discussion on the expressive power of such construction, see [7]). The intruder capabilities will determine how the messages are transferred from the output buffer to the input buffer.…”

Section: Runsmentioning

confidence: 99%

Operational Semantics of Security Protocols

Cremers

Mauw

2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Based on a concise domain analysis we develop a formal semantics of security protocols. Its main virtue is that it is a generic model, in the sense that it is parameterized over e.g. the intruder model. Further characteristics of the model are a straightforward handling of parallel execution of multiple protocols, locality of security claims, the binding of local constants to role instances, and explicitly defined initial intruder knowledge. We validate our framework by analysing the Needham-Schroeder-Lowe protocol.

show abstract

“…Especially in small systems, the problems caused by non-local choice and race choice can be solved by extra assumptions about the underlying communication system [12,4]. Typical properties that may help are communication synchrony, message order preservation, bounded buffer capacities and confirmed communications.…”

Section: Related Problems and Solutionsmentioning

confidence: 99%

Non-local Choice and Beyond: Intricacies of MSC Choice Nodes

Mooij

Goga

Romijn

2005

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. MSC is a visual formalism for specifying the behavior of systems. To obtain implementations for individual processes, the MSC choice construction poses fundamental problems. The best-studied cause is non-local choice, which e.g. is unavoidable in systems with autonomous processes. In this paper we characterize two additional problematic classes of choice nodes. Based on these three classes we point out some errors in related work. Extending our work on pragmatic implementations of nonlocal choice, we motivate a different choice semantics which allows a little more behavior. Finally, inspired by practical case studies, we present the first implementation approach for non-local choice nodes that can handle arbitrary numbers of processes.

show abstract

A Hierarchy of Communication Models for Message Sequence Charts

Cited by 8 publications

References 3 publications

Why Timed Sequence Diagrams Require Three-Event Semantics

Why Timed Sequence Diagrams Require Three-Event Semantics

Operational Semantics of Security Protocols

Non-local Choice and Beyond: Intricacies of MSC Choice Nodes

Contact Info

Product

Resources

About